./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version cde23df1
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m
[2024-06-14 14:50:33,823 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-06-14 14:50:33,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-14 14:50:33,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-06-14 14:50:33,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-14 14:50:33,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-14 14:50:33,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-14 14:50:33,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-14 14:50:33,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-14 14:50:33,915 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-06-14 14:50:33,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-14 14:50:33,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-14 14:50:33,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-14 14:50:33,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-06-14 14:50:33,917 INFO L153 SettingsManager]: * Use SBE=true
[2024-06-14 14:50:33,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-14 14:50:33,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-06-14 14:50:33,918 INFO L153 SettingsManager]: * sizeof long=4
[2024-06-14 14:50:33,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-06-14 14:50:33,918 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-06-14 14:50:33,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-06-14 14:50:33,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-06-14 14:50:33,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-14 14:50:33,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-06-14 14:50:33,919 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-06-14 14:50:33,919 INFO L153 SettingsManager]: * sizeof long double=12
[2024-06-14 14:50:33,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-06-14 14:50:33,920 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-06-14 14:50:33,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-14 14:50:33,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-06-14 14:50:33,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-06-14 14:50:33,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-06-14 14:50:33,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 14:50:33,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-14 14:50:33,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-06-14 14:50:33,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-14 14:50:33,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-06-14 14:50:33,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-14 14:50:33,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-14 14:50:33,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-14 14:50:33,923 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-14 14:50:33,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-06-14 14:50:33,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-14 14:50:33,923 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 14:50:34,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-14 14:50:34,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-14 14:50:34,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-14 14:50:34,161 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-06-14 14:50:34,161 INFO L274 PluginConnector]: CDTParser initialized
[2024-06-14 14:50:34,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-14 14:50:35,105 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-06-14 14:50:35,306 INFO L384 CDTParser]: Found 1 translation units.
[2024-06-14 14:50:35,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-14 14:50:35,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ab7f0e6/11108c2873b9433cb1d007472b9e808f/FLAG5752713d1
[2024-06-14 14:50:35,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ab7f0e6/11108c2873b9433cb1d007472b9e808f
[2024-06-14 14:50:35,342 INFO L270 PluginConnector]: Initializing Witness Parser...
[2024-06-14 14:50:35,342 INFO L274 PluginConnector]: Witness Parser initialized
[2024-06-14 14:50:35,343 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/mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml
[2024-06-14 14:50:35,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-14 14:50:35,469 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-14 14:50:35,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-14 14:50:35,470 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-14 14:50:35,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-14 14:50:35,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:50:35" (1/2) ...
[2024-06-14 14:50:35,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8d35ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:50:35, skipping insertion in model container
[2024-06-14 14:50:35,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:50:35" (1/2) ...
[2024-06-14 14:50:35,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@79d82936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:50:35, skipping insertion in model container
[2024-06-14 14:50:35,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:50:35" (2/2) ...
[2024-06-14 14:50:35,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8d35ed and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:50:35, skipping insertion in model container
[2024-06-14 14:50:35,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:50:35" (2/2) ...
[2024-06-14 14:50:35,478 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-14 14:50:35,549 INFO L95 edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-14 14:50:35,550 INFO L97 edCorrectnessWitness]: Location invariant before [L813-L813] (((((((((((((((! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EBX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)
[2024-06-14 14:50:35,551 INFO L97 edCorrectnessWitness]: Location invariant before [L814-L814] (((((((((((((((! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EBX <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)
[2024-06-14 14:50:35,551 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-14 14:50:35,552 INFO L106 edCorrectnessWitness]: ghost_update [L811-L811] multithreaded = 1;
[2024-06-14 14:50:35,590 INFO L177 MainTranslator]: Built tables and reachable declarations
[2024-06-14 14:50:35,891 INFO L207 PostProcessor]: Analyzing one entry point: main
[2024-06-14 14:50:35,898 INFO L202 MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-14 14:50:36,148 INFO L207 PostProcessor]: Analyzing one entry point: main
[2024-06-14 14:50:36,180 INFO L206 MainTranslator]: Completed translation
[2024-06-14 14:50:36,180 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:50:36 WrapperNode
[2024-06-14 14:50:36,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-14 14:50:36,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-14 14:50:36,181 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-14 14:50:36,181 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-14 14:50:36,186 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 02:50:36" (1/1) ...
[2024-06-14 14:50:36,233 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 02:50:36" (1/1) ...
[2024-06-14 14:50:36,304 INFO L138 Inliner]: procedures = 174, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 113
[2024-06-14 14:50:36,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-14 14:50:36,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-14 14:50:36,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-14 14:50:36,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-06-14 14:50:36,314 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 02:50:36" (1/1) ...
[2024-06-14 14:50:36,314 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 02:50:36" (1/1) ...
[2024-06-14 14:50:36,333 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 02:50:36" (1/1) ...
[2024-06-14 14:50:36,367 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 14:50:36,368 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 02:50:36" (1/1) ...
[2024-06-14 14:50:36,368 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 02:50:36" (1/1) ...
[2024-06-14 14:50:36,395 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 02:50:36" (1/1) ...
[2024-06-14 14:50:36,397 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 02:50:36" (1/1) ...
[2024-06-14 14:50:36,410 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 02:50:36" (1/1) ...
[2024-06-14 14:50:36,414 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 02:50:36" (1/1) ...
[2024-06-14 14:50:36,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-14 14:50:36,433 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-14 14:50:36,433 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-06-14 14:50:36,433 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-06-14 14:50:36,434 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 02:50:36" (1/1) ...
[2024-06-14 14:50:36,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 14:50:36,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-14 14:50:36,458 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 14:50:36,461 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 14:50:36,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-14 14:50:36,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-14 14:50:36,491 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-06-14 14:50:36,491 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-06-14 14:50:36,491 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-06-14 14:50:36,491 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-06-14 14:50:36,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-14 14:50:36,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-14 14:50:36,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-14 14:50:36,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-14 14:50:36,493 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 14:50:36,643 INFO L244 CfgBuilder]: Building ICFG
[2024-06-14 14:50:36,644 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-14 14:50:37,293 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-14 14:50:37,293 INFO L293 CfgBuilder]: Performing block encoding
[2024-06-14 14:50:37,491 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-14 14:50:37,491 INFO L320 CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-14 14:50:37,493 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:50:37 BoogieIcfgContainer
[2024-06-14 14:50:37,493 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-14 14:50:37,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-14 14:50:37,496 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-06-14 14:50:37,498 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-06-14 14:50:37,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:50:35" (1/4) ...
[2024-06-14 14:50:37,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b321d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:50:37, skipping insertion in model container
[2024-06-14 14:50:37,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:50:35" (2/4) ...
[2024-06-14 14:50:37,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b321d3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:50:37, skipping insertion in model container
[2024-06-14 14:50:37,504 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 02:50:36" (3/4) ...
[2024-06-14 14:50:37,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b321d3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:50:37, skipping insertion in model container
[2024-06-14 14:50:37,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:50:37" (4/4) ...
[2024-06-14 14:50:37,506 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-14 14:50:37,521 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-14 14:50:37,521 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-06-14 14:50:37,521 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-14 14:50:37,587 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-14 14:50:37,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 70 flow
[2024-06-14 14:50:37,669 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events.
[2024-06-14 14:50:37,671 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 14:50:37,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place.
[2024-06-14 14:50:37,674 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 70 flow
[2024-06-14 14:50:37,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 52 flow
[2024-06-14 14:50:37,690 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-14 14:50:37,697 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;@30c8f140, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-14 14:50:37,697 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2024-06-14 14:50:37,703 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-14 14:50:37,704 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-14 14:50:37,704 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 14:50:37,704 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:50:37,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-14 14:50:37,705 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:50:37,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:50:37,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1505849308, now seen corresponding path program 1 times
[2024-06-14 14:50:37,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:50:37,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97821448]
[2024-06-14 14:50:37,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:50:37,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:50:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:50:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:50:41,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:50:41,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97821448]
[2024-06-14 14:50:41,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97821448] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:50:41,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:50:41,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-14 14:50:41,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75281747]
[2024-06-14 14:50:41,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:50:41,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-14 14:50:41,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:50:41,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-14 14:50:41,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-14 14:50:41,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31
[2024-06-14 14:50:41,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:50:41,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:50:41,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31
[2024-06-14 14:50:41,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:50:41,551 INFO L124 PetriNetUnfolderBase]: 162/307 cut-off events.
[2024-06-14 14:50:41,552 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES.
[2024-06-14 14:50:41,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 307 events. 162/307 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1113 event pairs, 97 based on Foata normal form. 1/301 useless extension candidates. Maximal degree in co-relation 606. Up to 288 conditions per place.
[2024-06-14 14:50:41,557 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 23 selfloop transitions, 3 changer transitions 0/29 dead transitions.
[2024-06-14 14:50:41,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 119 flow
[2024-06-14 14:50:41,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-06-14 14:50:41,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-14 14:50:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions.
[2024-06-14 14:50:41,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365
[2024-06-14 14:50:41,567 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 3 states and 52 transitions.
[2024-06-14 14:50:41,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 119 flow
[2024-06-14 14:50:41,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-06-14 14:50:41,571 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 71 flow
[2024-06-14 14:50:41,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=25}
[2024-06-14 14:50:41,575 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places.
[2024-06-14 14:50:41,575 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 71 flow
[2024-06-14 14:50:41,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:50:41,576 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:50:41,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:50:41,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-14 14:50:41,576 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:50:41,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:50:41,577 INFO L85 PathProgramCache]: Analyzing trace with hash -282759621, now seen corresponding path program 1 times
[2024-06-14 14:50:41,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:50:41,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426574918]
[2024-06-14 14:50:41,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:50:41,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:50:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:50:44,446 INFO 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 14:50:44,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:50:44,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426574918]
[2024-06-14 14:50:44,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426574918] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:50:44,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:50:44,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-14 14:50:44,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974754508]
[2024-06-14 14:50:44,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:50:44,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-14 14:50:44,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:50:44,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-14 14:50:44,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-14 14:50:44,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31
[2024-06-14 14:50:44,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 71 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 14:50:44,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:50:44,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31
[2024-06-14 14:50:44,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:50:44,739 INFO L124 PetriNetUnfolderBase]: 159/304 cut-off events.
[2024-06-14 14:50:44,739 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES.
[2024-06-14 14:50:44,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 304 events. 159/304 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1089 event pairs, 79 based on Foata normal form. 2/306 useless extension candidates. Maximal degree in co-relation 679. Up to 274 conditions per place.
[2024-06-14 14:50:44,745 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 27 selfloop transitions, 5 changer transitions 0/35 dead transitions.
[2024-06-14 14:50:44,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 161 flow
[2024-06-14 14:50:44,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-06-14 14:50:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-14 14:50:44,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions.
[2024-06-14 14:50:44,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532258064516129
[2024-06-14 14:50:44,749 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 71 flow. Second operand 4 states and 66 transitions.
[2024-06-14 14:50:44,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 161 flow
[2024-06-14 14:50:44,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 14:50:44,753 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow
[2024-06-14 14:50:44,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=34, PETRI_TRANSITIONS=27}
[2024-06-14 14:50:44,754 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places.
[2024-06-14 14:50:44,755 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow
[2024-06-14 14:50:44,755 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 14:50:44,755 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:50:44,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:50:44,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-14 14:50:44,756 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:50:44,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:50:44,759 INFO L85 PathProgramCache]: Analyzing trace with hash -175612531, now seen corresponding path program 1 times
[2024-06-14 14:50:44,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:50:44,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697117506]
[2024-06-14 14:50:44,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:50:44,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:50:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:50:47,293 INFO 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 14:50:47,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:50:47,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697117506]
[2024-06-14 14:50:47,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697117506] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:50:47,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:50:47,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-14 14:50:47,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376697479]
[2024-06-14 14:50:47,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:50:47,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-14 14:50:47,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:50:47,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-14 14:50:47,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-14 14:50:47,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31
[2024-06-14 14:50:47,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:50:47,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:50:47,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31
[2024-06-14 14:50:47,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:50:47,578 INFO L124 PetriNetUnfolderBase]: 187/339 cut-off events.
[2024-06-14 14:50:47,579 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES.
[2024-06-14 14:50:47,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 339 events. 187/339 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1188 event pairs, 67 based on Foata normal form. 3/342 useless extension candidates. Maximal degree in co-relation 852. Up to 293 conditions per place.
[2024-06-14 14:50:47,581 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 36 selfloop transitions, 11 changer transitions 0/49 dead transitions.
[2024-06-14 14:50:47,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 255 flow
[2024-06-14 14:50:47,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-06-14 14:50:47,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 14:50:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions.
[2024-06-14 14:50:47,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5290322580645161
[2024-06-14 14:50:47,582 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 5 states and 82 transitions.
[2024-06-14 14:50:47,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 255 flow
[2024-06-14 14:50:47,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 246 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-06-14 14:50:47,584 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 162 flow
[2024-06-14 14:50:47,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=39, PETRI_TRANSITIONS=35}
[2024-06-14 14:50:47,585 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places.
[2024-06-14 14:50:47,585 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 162 flow
[2024-06-14 14:50:47,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:50:47,585 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:50:47,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:50:47,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-14 14:50:47,586 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:50:47,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:50:47,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1149020006, now seen corresponding path program 1 times
[2024-06-14 14:50:47,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:50:47,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990906856]
[2024-06-14 14:50:47,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:50:47,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:50:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:50:50,662 INFO 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 14:50:50,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:50:50,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990906856]
[2024-06-14 14:50:50,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990906856] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:50:50,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:50:50,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 14:50:50,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181736496]
[2024-06-14 14:50:50,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:50:50,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 14:50:50,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:50:50,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 14:50:50,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-14 14:50:50,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31
[2024-06-14 14:50:50,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:50:50,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:50:50,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31
[2024-06-14 14:50:50,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:50:51,005 INFO L124 PetriNetUnfolderBase]: 188/341 cut-off events.
[2024-06-14 14:50:51,005 INFO L125 PetriNetUnfolderBase]: For 417/417 co-relation queries the response was YES.
[2024-06-14 14:50:51,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 341 events. 188/341 cut-off events. For 417/417 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1198 event pairs, 46 based on Foata normal form. 3/344 useless extension candidates. Maximal degree in co-relation 1026. Up to 282 conditions per place.
[2024-06-14 14:50:51,009 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 40 selfloop transitions, 14 changer transitions 0/56 dead transitions.
[2024-06-14 14:50:51,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 340 flow
[2024-06-14 14:50:51,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-06-14 14:50:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:50:51,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions.
[2024-06-14 14:50:51,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645
[2024-06-14 14:50:51,014 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 162 flow. Second operand 6 states and 96 transitions.
[2024-06-14 14:50:51,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 340 flow
[2024-06-14 14:50:51,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 336 flow, removed 2 selfloop flow, removed 0 redundant places.
[2024-06-14 14:50:51,020 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 214 flow
[2024-06-14 14:50:51,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=45, PETRI_TRANSITIONS=38}
[2024-06-14 14:50:51,021 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places.
[2024-06-14 14:50:51,022 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 214 flow
[2024-06-14 14:50:51,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:50:51,022 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:50:51,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:50:51,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-14 14:50:51,022 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:50:51,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:50:51,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1260475274, now seen corresponding path program 1 times
[2024-06-14 14:50:51,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:50:51,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793152632]
[2024-06-14 14:50:51,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:50:51,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:50:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:50:54,198 INFO 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 14:50:54,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:50:54,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793152632]
[2024-06-14 14:50:54,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793152632] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:50:54,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:50:54,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:50:54,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528811813]
[2024-06-14 14:50:54,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:50:54,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:50:54,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:50:54,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:50:54,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:50:54,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31
[2024-06-14 14:50:54,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:50:54,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:50:54,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31
[2024-06-14 14:50:54,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:50:54,644 INFO L124 PetriNetUnfolderBase]: 189/344 cut-off events.
[2024-06-14 14:50:54,645 INFO L125 PetriNetUnfolderBase]: For 640/640 co-relation queries the response was YES.
[2024-06-14 14:50:54,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 344 events. 189/344 cut-off events. For 640/640 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1218 event pairs, 24 based on Foata normal form. 6/350 useless extension candidates. Maximal degree in co-relation 1156. Up to 259 conditions per place.
[2024-06-14 14:50:54,647 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 40 selfloop transitions, 16 changer transitions 0/58 dead transitions.
[2024-06-14 14:50:54,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 386 flow
[2024-06-14 14:50:54,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-06-14 14:50:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:50:54,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions.
[2024-06-14 14:50:54,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355
[2024-06-14 14:50:54,649 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 214 flow. Second operand 7 states and 105 transitions.
[2024-06-14 14:50:54,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 386 flow
[2024-06-14 14:50:54,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 354 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-06-14 14:50:54,653 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 217 flow
[2024-06-14 14:50:54,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=47, PETRI_TRANSITIONS=38}
[2024-06-14 14:50:54,657 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places.
[2024-06-14 14:50:54,657 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 217 flow
[2024-06-14 14:50:54,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:50:54,658 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:50:54,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:50:54,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-14 14:50:54,659 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:50:54,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:50:54,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1934851801, now seen corresponding path program 1 times
[2024-06-14 14:50:54,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:50:54,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055839174]
[2024-06-14 14:50:54,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:50:54,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:50:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:51:00,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 14:51:00,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:51:00,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055839174]
[2024-06-14 14:51:00,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055839174] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:51:00,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:51:00,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 14:51:00,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681404213]
[2024-06-14 14:51:00,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:51:00,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 14:51:00,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:51:00,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 14:51:00,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-14 14:51:00,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:51:00,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:00,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:51:00,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:51:00,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:51:00,423 INFO L124 PetriNetUnfolderBase]: 187/341 cut-off events.
[2024-06-14 14:51:00,423 INFO L125 PetriNetUnfolderBase]: For 747/747 co-relation queries the response was YES.
[2024-06-14 14:51:00,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 341 events. 187/341 cut-off events. For 747/747 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1194 event pairs, 47 based on Foata normal form. 1/342 useless extension candidates. Maximal degree in co-relation 1202. Up to 329 conditions per place.
[2024-06-14 14:51:00,426 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 35 selfloop transitions, 6 changer transitions 0/43 dead transitions.
[2024-06-14 14:51:00,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 311 flow
[2024-06-14 14:51:00,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-06-14 14:51:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 14:51:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions.
[2024-06-14 14:51:00,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484
[2024-06-14 14:51:00,428 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 217 flow. Second operand 5 states and 60 transitions.
[2024-06-14 14:51:00,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 311 flow
[2024-06-14 14:51:00,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 270 flow, removed 6 selfloop flow, removed 5 redundant places.
[2024-06-14 14:51:00,431 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 193 flow
[2024-06-14 14:51:00,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=47, PETRI_TRANSITIONS=38}
[2024-06-14 14:51:00,434 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places.
[2024-06-14 14:51:00,434 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 193 flow
[2024-06-14 14:51:00,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:00,434 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:00,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:00,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-14 14:51:00,435 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:51:00,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:00,435 INFO L85 PathProgramCache]: Analyzing trace with hash 137115187, now seen corresponding path program 1 times
[2024-06-14 14:51:00,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:00,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717024395]
[2024-06-14 14:51:00,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:00,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:51:06,504 INFO 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 14:51:06,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:51:06,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717024395]
[2024-06-14 14:51:06,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717024395] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:51:06,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:51:06,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:51:06,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999078205]
[2024-06-14 14:51:06,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:51:06,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:51:06,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:51:06,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:51:06,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:51:06,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:51:06,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 193 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:06,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:51:06,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:51:06,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:51:06,911 INFO L124 PetriNetUnfolderBase]: 181/332 cut-off events.
[2024-06-14 14:51:06,911 INFO L125 PetriNetUnfolderBase]: For 877/877 co-relation queries the response was YES.
[2024-06-14 14:51:06,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 332 events. 181/332 cut-off events. For 877/877 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1134 event pairs, 44 based on Foata normal form. 3/335 useless extension candidates. Maximal degree in co-relation 1128. Up to 311 conditions per place.
[2024-06-14 14:51:06,913 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 38 selfloop transitions, 8 changer transitions 0/48 dead transitions.
[2024-06-14 14:51:06,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 311 flow
[2024-06-14 14:51:06,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-06-14 14:51:06,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:51:06,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions.
[2024-06-14 14:51:06,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3817204301075269
[2024-06-14 14:51:06,915 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 193 flow. Second operand 6 states and 71 transitions.
[2024-06-14 14:51:06,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 311 flow
[2024-06-14 14:51:06,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 296 flow, removed 1 selfloop flow, removed 4 redundant places.
[2024-06-14 14:51:06,916 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 211 flow
[2024-06-14 14:51:06,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=49, PETRI_TRANSITIONS=40}
[2024-06-14 14:51:06,917 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places.
[2024-06-14 14:51:06,917 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 211 flow
[2024-06-14 14:51:06,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:06,918 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:06,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:06,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-14 14:51:06,918 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:51:06,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:06,918 INFO L85 PathProgramCache]: Analyzing trace with hash -514451052, now seen corresponding path program 1 times
[2024-06-14 14:51:06,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:06,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497311244]
[2024-06-14 14:51:06,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:06,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:51:11,112 INFO 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 14:51:11,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:51:11,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497311244]
[2024-06-14 14:51:11,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497311244] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:51:11,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:51:11,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:51:11,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027812021]
[2024-06-14 14:51:11,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:51:11,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:51:11,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:51:11,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:51:11,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:51:11,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:51:11,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 211 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:11,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:51:11,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:51:11,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:51:11,401 INFO L124 PetriNetUnfolderBase]: 182/334 cut-off events.
[2024-06-14 14:51:11,401 INFO L125 PetriNetUnfolderBase]: For 1009/1009 co-relation queries the response was YES.
[2024-06-14 14:51:11,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 334 events. 182/334 cut-off events. For 1009/1009 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1158 event pairs, 43 based on Foata normal form. 2/336 useless extension candidates. Maximal degree in co-relation 1200. Up to 288 conditions per place.
[2024-06-14 14:51:11,404 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 37 selfloop transitions, 13 changer transitions 0/52 dead transitions.
[2024-06-14 14:51:11,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 362 flow
[2024-06-14 14:51:11,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-06-14 14:51:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:51:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions.
[2024-06-14 14:51:11,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41397849462365593
[2024-06-14 14:51:11,417 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 211 flow. Second operand 6 states and 77 transitions.
[2024-06-14 14:51:11,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 362 flow
[2024-06-14 14:51:11,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 345 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-14 14:51:11,421 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 242 flow
[2024-06-14 14:51:11,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=51, PETRI_TRANSITIONS=42}
[2024-06-14 14:51:11,423 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places.
[2024-06-14 14:51:11,423 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 242 flow
[2024-06-14 14:51:11,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:11,423 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:11,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:11,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-14 14:51:11,424 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:51:11,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:11,424 INFO L85 PathProgramCache]: Analyzing trace with hash 328483800, now seen corresponding path program 2 times
[2024-06-14 14:51:11,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:11,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008343711]
[2024-06-14 14:51:11,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:11,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:51:15,417 INFO 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 14:51:15,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:51:15,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008343711]
[2024-06-14 14:51:15,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008343711] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:51:15,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:51:15,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:51:15,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644023738]
[2024-06-14 14:51:15,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:51:15,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:51:15,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:51:15,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:51:15,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:51:15,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:51:15,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 242 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:15,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:51:15,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:51:15,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:51:15,718 INFO L124 PetriNetUnfolderBase]: 177/324 cut-off events.
[2024-06-14 14:51:15,719 INFO L125 PetriNetUnfolderBase]: For 1164/1164 co-relation queries the response was YES.
[2024-06-14 14:51:15,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 324 events. 177/324 cut-off events. For 1164/1164 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1103 event pairs, 42 based on Foata normal form. 1/325 useless extension candidates. Maximal degree in co-relation 1201. Up to 309 conditions per place.
[2024-06-14 14:51:15,721 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 38 selfloop transitions, 8 changer transitions 0/48 dead transitions.
[2024-06-14 14:51:15,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 348 flow
[2024-06-14 14:51:15,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-06-14 14:51:15,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:51:15,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions.
[2024-06-14 14:51:15,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839
[2024-06-14 14:51:15,722 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 242 flow. Second operand 6 states and 69 transitions.
[2024-06-14 14:51:15,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 348 flow
[2024-06-14 14:51:15,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 333 flow, removed 1 selfloop flow, removed 3 redundant places.
[2024-06-14 14:51:15,724 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 248 flow
[2024-06-14 14:51:15,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=54, PETRI_TRANSITIONS=42}
[2024-06-14 14:51:15,725 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places.
[2024-06-14 14:51:15,725 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 248 flow
[2024-06-14 14:51:15,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:15,725 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:15,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:15,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-14 14:51:15,726 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:51:15,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:15,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1553636556, now seen corresponding path program 1 times
[2024-06-14 14:51:15,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:15,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655024168]
[2024-06-14 14:51:15,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:15,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:51:20,222 INFO 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 14:51:20,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:51:20,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655024168]
[2024-06-14 14:51:20,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655024168] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:51:20,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:51:20,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:51:20,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51695916]
[2024-06-14 14:51:20,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:51:20,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:51:20,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:51:20,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:51:20,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:51:20,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:51:20,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 248 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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 14:51:20,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:51:20,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:51:20,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:51:20,669 INFO L124 PetriNetUnfolderBase]: 215/386 cut-off events.
[2024-06-14 14:51:20,669 INFO L125 PetriNetUnfolderBase]: For 1838/1838 co-relation queries the response was YES.
[2024-06-14 14:51:20,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1463 conditions, 386 events. 215/386 cut-off events. For 1838/1838 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1383 event pairs, 49 based on Foata normal form. 6/392 useless extension candidates. Maximal degree in co-relation 1435. Up to 276 conditions per place.
[2024-06-14 14:51:20,672 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 46 selfloop transitions, 18 changer transitions 0/66 dead transitions.
[2024-06-14 14:51:20,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 66 transitions, 464 flow
[2024-06-14 14:51:20,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-06-14 14:51:20,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:51:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions.
[2024-06-14 14:51:20,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40725806451612906
[2024-06-14 14:51:20,673 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 248 flow. Second operand 8 states and 101 transitions.
[2024-06-14 14:51:20,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 66 transitions, 464 flow
[2024-06-14 14:51:20,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 430 flow, removed 2 selfloop flow, removed 6 redundant places.
[2024-06-14 14:51:20,677 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 297 flow
[2024-06-14 14:51:20,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=297, PETRI_PLACES=57, PETRI_TRANSITIONS=49}
[2024-06-14 14:51:20,678 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 27 predicate places.
[2024-06-14 14:51:20,680 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 297 flow
[2024-06-14 14:51:20,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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 14:51:20,680 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:20,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:20,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-14 14:51:20,681 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:51:20,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:20,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1587045232, now seen corresponding path program 2 times
[2024-06-14 14:51:20,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:20,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638860772]
[2024-06-14 14:51:20,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:20,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:51:24,820 INFO 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 14:51:24,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:51:24,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638860772]
[2024-06-14 14:51:24,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638860772] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:51:24,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:51:24,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:51:24,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497979479]
[2024-06-14 14:51:24,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:51:24,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:51:24,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:51:24,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:51:24,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:51:24,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:51:24,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 297 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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 14:51:24,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:51:24,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:51:24,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:51:25,222 INFO L124 PetriNetUnfolderBase]: 224/401 cut-off events.
[2024-06-14 14:51:25,222 INFO L125 PetriNetUnfolderBase]: For 2166/2166 co-relation queries the response was YES.
[2024-06-14 14:51:25,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 401 events. 224/401 cut-off events. For 2166/2166 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1452 event pairs, 48 based on Foata normal form. 3/404 useless extension candidates. Maximal degree in co-relation 1642. Up to 377 conditions per place.
[2024-06-14 14:51:25,225 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 48 selfloop transitions, 10 changer transitions 0/60 dead transitions.
[2024-06-14 14:51:25,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 449 flow
[2024-06-14 14:51:25,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-06-14 14:51:25,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:51:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions.
[2024-06-14 14:51:25,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3686635944700461
[2024-06-14 14:51:25,227 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 297 flow. Second operand 7 states and 80 transitions.
[2024-06-14 14:51:25,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 449 flow
[2024-06-14 14:51:25,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 60 transitions, 430 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-14 14:51:25,232 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 321 flow
[2024-06-14 14:51:25,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=321, PETRI_PLACES=61, PETRI_TRANSITIONS=51}
[2024-06-14 14:51:25,232 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 31 predicate places.
[2024-06-14 14:51:25,232 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 321 flow
[2024-06-14 14:51:25,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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 14:51:25,233 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:25,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:25,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-14 14:51:25,233 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:51:25,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:25,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1376505036, now seen corresponding path program 3 times
[2024-06-14 14:51:25,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:25,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998929797]
[2024-06-14 14:51:25,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:25,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:51:29,408 INFO 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 14:51:29,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:51:29,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998929797]
[2024-06-14 14:51:29,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998929797] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:51:29,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:51:29,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:51:29,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748758362]
[2024-06-14 14:51:29,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:51:29,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:51:29,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:51:29,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:51:29,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:51:29,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:51:29,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 321 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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 14:51:29,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:51:29,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:51:29,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:51:29,881 INFO L124 PetriNetUnfolderBase]: 218/392 cut-off events.
[2024-06-14 14:51:29,882 INFO L125 PetriNetUnfolderBase]: For 2390/2390 co-relation queries the response was YES.
[2024-06-14 14:51:29,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1673 conditions, 392 events. 218/392 cut-off events. For 2390/2390 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1411 event pairs, 46 based on Foata normal form. 3/395 useless extension candidates. Maximal degree in co-relation 1641. Up to 356 conditions per place.
[2024-06-14 14:51:29,885 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 49 selfloop transitions, 14 changer transitions 0/65 dead transitions.
[2024-06-14 14:51:29,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 65 transitions, 495 flow
[2024-06-14 14:51:29,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-06-14 14:51:29,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:51:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions.
[2024-06-14 14:51:29,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839
[2024-06-14 14:51:29,888 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 321 flow. Second operand 8 states and 92 transitions.
[2024-06-14 14:51:29,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 65 transitions, 495 flow
[2024-06-14 14:51:29,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 65 transitions, 470 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-14 14:51:29,896 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 351 flow
[2024-06-14 14:51:29,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=351, PETRI_PLACES=64, PETRI_TRANSITIONS=53}
[2024-06-14 14:51:29,897 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places.
[2024-06-14 14:51:29,897 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 351 flow
[2024-06-14 14:51:29,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 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 14:51:29,898 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:29,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:29,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-14 14:51:29,898 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:51:29,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:29,898 INFO L85 PathProgramCache]: Analyzing trace with hash -470005645, now seen corresponding path program 1 times
[2024-06-14 14:51:29,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:29,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22921835]
[2024-06-14 14:51:29,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:29,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:51:34,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 14:51:34,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:51:34,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22921835]
[2024-06-14 14:51:34,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22921835] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:51:34,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:51:34,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:51:34,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540870257]
[2024-06-14 14:51:34,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:51:34,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:51:34,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:51:34,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:51:34,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:51:34,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:51:34,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 351 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:34,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:51:34,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:51:34,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:51:35,203 INFO L124 PetriNetUnfolderBase]: 250/449 cut-off events.
[2024-06-14 14:51:35,204 INFO L125 PetriNetUnfolderBase]: For 2812/2812 co-relation queries the response was YES.
[2024-06-14 14:51:35,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1958 conditions, 449 events. 250/449 cut-off events. For 2812/2812 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1707 event pairs, 96 based on Foata normal form. 1/450 useless extension candidates. Maximal degree in co-relation 1925. Up to 395 conditions per place.
[2024-06-14 14:51:35,207 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 58 selfloop transitions, 19 changer transitions 0/79 dead transitions.
[2024-06-14 14:51:35,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 79 transitions, 663 flow
[2024-06-14 14:51:35,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-06-14 14:51:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:51:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions.
[2024-06-14 14:51:35,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839
[2024-06-14 14:51:35,209 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 351 flow. Second operand 8 states and 92 transitions.
[2024-06-14 14:51:35,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 79 transitions, 663 flow
[2024-06-14 14:51:35,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 79 transitions, 624 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-14 14:51:35,215 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 472 flow
[2024-06-14 14:51:35,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=472, PETRI_PLACES=69, PETRI_TRANSITIONS=66}
[2024-06-14 14:51:35,216 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places.
[2024-06-14 14:51:35,216 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 472 flow
[2024-06-14 14:51:35,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:35,216 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:35,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:35,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-14 14:51:35,217 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:51:35,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:35,217 INFO L85 PathProgramCache]: Analyzing trace with hash 15155261, now seen corresponding path program 2 times
[2024-06-14 14:51:35,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:35,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104493527]
[2024-06-14 14:51:35,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:35,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:51:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:51:40,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:51:40,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104493527]
[2024-06-14 14:51:40,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104493527] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:51:40,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:51:40,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:51:40,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716934380]
[2024-06-14 14:51:40,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:51:40,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:51:40,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:51:40,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:51:40,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:51:40,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:51:40,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 472 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:40,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:51:40,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:51:40,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:51:40,934 INFO L124 PetriNetUnfolderBase]: 262/469 cut-off events.
[2024-06-14 14:51:40,935 INFO L125 PetriNetUnfolderBase]: For 3392/3392 co-relation queries the response was YES.
[2024-06-14 14:51:40,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2170 conditions, 469 events. 262/469 cut-off events. For 3392/3392 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1806 event pairs, 50 based on Foata normal form. 1/470 useless extension candidates. Maximal degree in co-relation 2133. Up to 391 conditions per place.
[2024-06-14 14:51:40,938 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 64 selfloop transitions, 24 changer transitions 0/90 dead transitions.
[2024-06-14 14:51:40,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 90 transitions, 797 flow
[2024-06-14 14:51:40,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-06-14 14:51:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:51:40,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions.
[2024-06-14 14:51:40,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39919354838709675
[2024-06-14 14:51:40,941 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 472 flow. Second operand 8 states and 99 transitions.
[2024-06-14 14:51:40,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 90 transitions, 797 flow
[2024-06-14 14:51:40,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 90 transitions, 785 flow, removed 5 selfloop flow, removed 1 redundant places.
[2024-06-14 14:51:40,946 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 601 flow
[2024-06-14 14:51:40,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=601, PETRI_PLACES=78, PETRI_TRANSITIONS=74}
[2024-06-14 14:51:40,947 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places.
[2024-06-14 14:51:40,947 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 601 flow
[2024-06-14 14:51:40,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:40,948 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:40,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:40,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-14 14:51:40,948 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:51:40,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:40,948 INFO L85 PathProgramCache]: Analyzing trace with hash 322704401, now seen corresponding path program 3 times
[2024-06-14 14:51:40,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:40,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749108650]
[2024-06-14 14:51:40,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:40,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:51:45,297 INFO 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 14:51:45,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:51:45,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749108650]
[2024-06-14 14:51:45,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749108650] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:51:45,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:51:45,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:51:45,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136314216]
[2024-06-14 14:51:45,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:51:45,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:51:45,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:51:45,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:51:45,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:51:45,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:51:45,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 601 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:45,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:51:45,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:51:45,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:51:45,685 INFO L124 PetriNetUnfolderBase]: 260/466 cut-off events.
[2024-06-14 14:51:45,686 INFO L125 PetriNetUnfolderBase]: For 4029/4029 co-relation queries the response was YES.
[2024-06-14 14:51:45,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2302 conditions, 466 events. 260/466 cut-off events. For 4029/4029 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1783 event pairs, 48 based on Foata normal form. 1/467 useless extension candidates. Maximal degree in co-relation 2260. Up to 400 conditions per place.
[2024-06-14 14:51:45,689 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 64 selfloop transitions, 22 changer transitions 0/88 dead transitions.
[2024-06-14 14:51:45,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 88 transitions, 829 flow
[2024-06-14 14:51:45,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-06-14 14:51:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:51:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions.
[2024-06-14 14:51:45,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645
[2024-06-14 14:51:45,691 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 601 flow. Second operand 8 states and 97 transitions.
[2024-06-14 14:51:45,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 88 transitions, 829 flow
[2024-06-14 14:51:45,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 88 transitions, 786 flow, removed 18 selfloop flow, removed 2 redundant places.
[2024-06-14 14:51:45,697 INFO L231 Difference]: Finished difference. Result has 86 places, 77 transitions, 647 flow
[2024-06-14 14:51:45,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=647, PETRI_PLACES=86, PETRI_TRANSITIONS=77}
[2024-06-14 14:51:45,698 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 56 predicate places.
[2024-06-14 14:51:45,698 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 77 transitions, 647 flow
[2024-06-14 14:51:45,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:45,698 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:45,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:45,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-14 14:51:45,699 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:51:45,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:45,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1729931091, now seen corresponding path program 4 times
[2024-06-14 14:51:45,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:45,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242204862]
[2024-06-14 14:51:45,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:45,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:51:51,436 INFO 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 14:51:51,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:51:51,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242204862]
[2024-06-14 14:51:51,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242204862] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:51:51,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:51:51,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:51:51,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410570070]
[2024-06-14 14:51:51,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:51:51,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:51:51,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:51:51,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:51:51,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:51:51,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:51:51,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 77 transitions, 647 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:51,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:51:51,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:51:51,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:51:51,808 INFO L124 PetriNetUnfolderBase]: 258/463 cut-off events.
[2024-06-14 14:51:51,809 INFO L125 PetriNetUnfolderBase]: For 4489/4489 co-relation queries the response was YES.
[2024-06-14 14:51:51,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2345 conditions, 463 events. 258/463 cut-off events. For 4489/4489 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1768 event pairs, 50 based on Foata normal form. 1/464 useless extension candidates. Maximal degree in co-relation 2299. Up to 362 conditions per place.
[2024-06-14 14:51:51,814 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 56 selfloop transitions, 34 changer transitions 0/92 dead transitions.
[2024-06-14 14:51:51,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 92 transitions, 926 flow
[2024-06-14 14:51:51,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-06-14 14:51:51,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:51:51,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions.
[2024-06-14 14:51:51,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.423963133640553
[2024-06-14 14:51:51,815 INFO L175 Difference]: Start difference. First operand has 86 places, 77 transitions, 647 flow. Second operand 7 states and 92 transitions.
[2024-06-14 14:51:51,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 92 transitions, 926 flow
[2024-06-14 14:51:51,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 92 transitions, 887 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-14 14:51:51,823 INFO L231 Difference]: Finished difference. Result has 89 places, 81 transitions, 747 flow
[2024-06-14 14:51:51,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=747, PETRI_PLACES=89, PETRI_TRANSITIONS=81}
[2024-06-14 14:51:51,824 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places.
[2024-06-14 14:51:51,824 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 81 transitions, 747 flow
[2024-06-14 14:51:51,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:51,824 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:51,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:51,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-14 14:51:51,825 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:51:51,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:51,825 INFO L85 PathProgramCache]: Analyzing trace with hash 803673648, now seen corresponding path program 1 times
[2024-06-14 14:51:51,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:51,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252903818]
[2024-06-14 14:51:51,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:51,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:51:57,774 INFO 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 14:51:57,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:51:57,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252903818]
[2024-06-14 14:51:57,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252903818] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:51:57,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:51:57,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:51:57,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935547793]
[2024-06-14 14:51:57,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:51:57,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:51:57,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:51:57,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:51:57,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:51:57,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:51:57,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 81 transitions, 747 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:57,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:51:57,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:51:57,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:51:58,204 INFO L124 PetriNetUnfolderBase]: 304/539 cut-off events.
[2024-06-14 14:51:58,204 INFO L125 PetriNetUnfolderBase]: For 5878/5878 co-relation queries the response was YES.
[2024-06-14 14:51:58,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2800 conditions, 539 events. 304/539 cut-off events. For 5878/5878 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2149 event pairs, 49 based on Foata normal form. 3/542 useless extension candidates. Maximal degree in co-relation 2752. Up to 427 conditions per place.
[2024-06-14 14:51:58,209 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 81 selfloop transitions, 28 changer transitions 0/111 dead transitions.
[2024-06-14 14:51:58,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 111 transitions, 1133 flow
[2024-06-14 14:51:58,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:51:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:51:58,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions.
[2024-06-14 14:51:58,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-14 14:51:58,211 INFO L175 Difference]: Start difference. First operand has 89 places, 81 transitions, 747 flow. Second operand 10 states and 124 transitions.
[2024-06-14 14:51:58,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 111 transitions, 1133 flow
[2024-06-14 14:51:58,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 111 transitions, 1069 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-14 14:51:58,220 INFO L231 Difference]: Finished difference. Result has 97 places, 91 transitions, 860 flow
[2024-06-14 14:51:58,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=860, PETRI_PLACES=97, PETRI_TRANSITIONS=91}
[2024-06-14 14:51:58,221 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 67 predicate places.
[2024-06-14 14:51:58,221 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 91 transitions, 860 flow
[2024-06-14 14:51:58,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:58,221 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:58,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:58,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-14 14:51:58,222 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:51:58,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:58,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1391165080, now seen corresponding path program 2 times
[2024-06-14 14:51:58,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:58,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409784638]
[2024-06-14 14:51:58,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:58,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:04,825 INFO 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 14:52:04,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:04,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409784638]
[2024-06-14 14:52:04,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409784638] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:04,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:04,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:52:04,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802181714]
[2024-06-14 14:52:04,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:04,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:52:04,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:04,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:52:04,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:52:04,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:52:04,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 91 transitions, 860 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:04,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:04,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:52:04,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:05,377 INFO L124 PetriNetUnfolderBase]: 298/530 cut-off events.
[2024-06-14 14:52:05,377 INFO L125 PetriNetUnfolderBase]: For 5185/5185 co-relation queries the response was YES.
[2024-06-14 14:52:05,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2774 conditions, 530 events. 298/530 cut-off events. For 5185/5185 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2108 event pairs, 50 based on Foata normal form. 3/533 useless extension candidates. Maximal degree in co-relation 2724. Up to 423 conditions per place.
[2024-06-14 14:52:05,382 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 78 selfloop transitions, 29 changer transitions 0/109 dead transitions.
[2024-06-14 14:52:05,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 109 transitions, 1122 flow
[2024-06-14 14:52:05,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:52:05,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:52:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions.
[2024-06-14 14:52:05,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742
[2024-06-14 14:52:05,383 INFO L175 Difference]: Start difference. First operand has 97 places, 91 transitions, 860 flow. Second operand 10 states and 122 transitions.
[2024-06-14 14:52:05,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 109 transitions, 1122 flow
[2024-06-14 14:52:05,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 109 transitions, 1089 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-06-14 14:52:05,392 INFO L231 Difference]: Finished difference. Result has 104 places, 91 transitions, 890 flow
[2024-06-14 14:52:05,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=890, PETRI_PLACES=104, PETRI_TRANSITIONS=91}
[2024-06-14 14:52:05,393 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 74 predicate places.
[2024-06-14 14:52:05,393 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 91 transitions, 890 flow
[2024-06-14 14:52:05,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:05,394 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:05,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:05,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-14 14:52:05,394 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:52:05,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:05,394 INFO L85 PathProgramCache]: Analyzing trace with hash -469915435, now seen corresponding path program 5 times
[2024-06-14 14:52:05,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:05,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887586527]
[2024-06-14 14:52:05,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:05,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:09,730 INFO 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 14:52:09,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:09,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887586527]
[2024-06-14 14:52:09,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887586527] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:09,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:09,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:52:09,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289060251]
[2024-06-14 14:52:09,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:09,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:52:09,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:09,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:52:09,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:52:09,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:52:09,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 91 transitions, 890 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:09,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:09,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:52:09,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:10,147 INFO L124 PetriNetUnfolderBase]: 296/527 cut-off events.
[2024-06-14 14:52:10,147 INFO L125 PetriNetUnfolderBase]: For 5454/5454 co-relation queries the response was YES.
[2024-06-14 14:52:10,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2837 conditions, 527 events. 296/527 cut-off events. For 5454/5454 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2082 event pairs, 54 based on Foata normal form. 1/528 useless extension candidates. Maximal degree in co-relation 2785. Up to 454 conditions per place.
[2024-06-14 14:52:10,152 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 69 selfloop transitions, 28 changer transitions 0/99 dead transitions.
[2024-06-14 14:52:10,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 99 transitions, 1104 flow
[2024-06-14 14:52:10,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-06-14 14:52:10,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:52:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions.
[2024-06-14 14:52:10,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.391705069124424
[2024-06-14 14:52:10,154 INFO L175 Difference]: Start difference. First operand has 104 places, 91 transitions, 890 flow. Second operand 7 states and 85 transitions.
[2024-06-14 14:52:10,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 99 transitions, 1104 flow
[2024-06-14 14:52:10,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 99 transitions, 1044 flow, removed 1 selfloop flow, removed 9 redundant places.
[2024-06-14 14:52:10,165 INFO L231 Difference]: Finished difference. Result has 102 places, 91 transitions, 894 flow
[2024-06-14 14:52:10,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=894, PETRI_PLACES=102, PETRI_TRANSITIONS=91}
[2024-06-14 14:52:10,166 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 72 predicate places.
[2024-06-14 14:52:10,166 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 91 transitions, 894 flow
[2024-06-14 14:52:10,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:10,167 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:10,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:10,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-14 14:52:10,167 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:52:10,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:10,168 INFO L85 PathProgramCache]: Analyzing trace with hash -918097762, now seen corresponding path program 3 times
[2024-06-14 14:52:10,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:10,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899804563]
[2024-06-14 14:52:10,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:10,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:14,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:52:14,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:14,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899804563]
[2024-06-14 14:52:14,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899804563] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:14,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:14,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:52:14,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095346605]
[2024-06-14 14:52:14,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:14,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:52:14,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:14,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:52:14,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:52:14,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:52:14,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 91 transitions, 894 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:14,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:14,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:52:14,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:15,024 INFO L124 PetriNetUnfolderBase]: 305/544 cut-off events.
[2024-06-14 14:52:15,025 INFO L125 PetriNetUnfolderBase]: For 6196/6196 co-relation queries the response was YES.
[2024-06-14 14:52:15,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2916 conditions, 544 events. 305/544 cut-off events. For 6196/6196 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2202 event pairs, 72 based on Foata normal form. 3/547 useless extension candidates. Maximal degree in co-relation 2863. Up to 357 conditions per place.
[2024-06-14 14:52:15,029 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 68 selfloop transitions, 42 changer transitions 0/112 dead transitions.
[2024-06-14 14:52:15,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 112 transitions, 1227 flow
[2024-06-14 14:52:15,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-06-14 14:52:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:52:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions.
[2024-06-14 14:52:15,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4274193548387097
[2024-06-14 14:52:15,030 INFO L175 Difference]: Start difference. First operand has 102 places, 91 transitions, 894 flow. Second operand 8 states and 106 transitions.
[2024-06-14 14:52:15,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 112 transitions, 1227 flow
[2024-06-14 14:52:15,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 112 transitions, 1173 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-14 14:52:15,041 INFO L231 Difference]: Finished difference. Result has 105 places, 93 transitions, 952 flow
[2024-06-14 14:52:15,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=952, PETRI_PLACES=105, PETRI_TRANSITIONS=93}
[2024-06-14 14:52:15,042 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 75 predicate places.
[2024-06-14 14:52:15,042 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 93 transitions, 952 flow
[2024-06-14 14:52:15,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:15,042 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:15,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:15,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-14 14:52:15,043 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:52:15,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:15,043 INFO L85 PathProgramCache]: Analyzing trace with hash -918092182, now seen corresponding path program 4 times
[2024-06-14 14:52:15,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:15,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434999813]
[2024-06-14 14:52:15,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:15,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:19,855 INFO 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 14:52:19,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:19,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434999813]
[2024-06-14 14:52:19,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434999813] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:19,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:19,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:52:19,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767640558]
[2024-06-14 14:52:19,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:19,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:52:19,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:19,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:52:19,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:52:20,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:52:20,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 93 transitions, 952 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:20,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:20,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:52:20,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:20,355 INFO L124 PetriNetUnfolderBase]: 314/557 cut-off events.
[2024-06-14 14:52:20,355 INFO L125 PetriNetUnfolderBase]: For 6934/6934 co-relation queries the response was YES.
[2024-06-14 14:52:20,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3105 conditions, 557 events. 314/557 cut-off events. For 6934/6934 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2257 event pairs, 57 based on Foata normal form. 3/560 useless extension candidates. Maximal degree in co-relation 3051. Up to 365 conditions per place.
[2024-06-14 14:52:20,359 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 69 selfloop transitions, 41 changer transitions 0/112 dead transitions.
[2024-06-14 14:52:20,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 112 transitions, 1276 flow
[2024-06-14 14:52:20,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:52:20,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:52:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions.
[2024-06-14 14:52:20,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4014336917562724
[2024-06-14 14:52:20,361 INFO L175 Difference]: Start difference. First operand has 105 places, 93 transitions, 952 flow. Second operand 9 states and 112 transitions.
[2024-06-14 14:52:20,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 112 transitions, 1276 flow
[2024-06-14 14:52:20,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 112 transitions, 1174 flow, removed 6 selfloop flow, removed 7 redundant places.
[2024-06-14 14:52:20,372 INFO L231 Difference]: Finished difference. Result has 107 places, 95 transitions, 966 flow
[2024-06-14 14:52:20,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=966, PETRI_PLACES=107, PETRI_TRANSITIONS=95}
[2024-06-14 14:52:20,373 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 77 predicate places.
[2024-06-14 14:52:20,373 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 95 transitions, 966 flow
[2024-06-14 14:52:20,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:20,373 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:20,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:20,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-14 14:52:20,373 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:52:20,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:20,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1953762734, now seen corresponding path program 5 times
[2024-06-14 14:52:20,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:20,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186183349]
[2024-06-14 14:52:20,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:20,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:24,909 INFO 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 14:52:24,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:24,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186183349]
[2024-06-14 14:52:24,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186183349] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:24,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:24,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:52:24,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139647067]
[2024-06-14 14:52:24,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:24,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:52:24,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:24,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:52:24,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:52:25,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:52:25,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 95 transitions, 966 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:25,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:25,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:52:25,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:25,375 INFO L124 PetriNetUnfolderBase]: 323/572 cut-off events.
[2024-06-14 14:52:25,376 INFO L125 PetriNetUnfolderBase]: For 6906/6906 co-relation queries the response was YES.
[2024-06-14 14:52:25,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3172 conditions, 572 events. 323/572 cut-off events. For 6906/6906 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2330 event pairs, 107 based on Foata normal form. 3/575 useless extension candidates. Maximal degree in co-relation 3118. Up to 532 conditions per place.
[2024-06-14 14:52:25,380 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 93 selfloop transitions, 13 changer transitions 0/108 dead transitions.
[2024-06-14 14:52:25,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 108 transitions, 1230 flow
[2024-06-14 14:52:25,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-06-14 14:52:25,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:52:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions.
[2024-06-14 14:52:25,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36693548387096775
[2024-06-14 14:52:25,381 INFO L175 Difference]: Start difference. First operand has 107 places, 95 transitions, 966 flow. Second operand 8 states and 91 transitions.
[2024-06-14 14:52:25,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 108 transitions, 1230 flow
[2024-06-14 14:52:25,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 108 transitions, 1162 flow, removed 5 selfloop flow, removed 7 redundant places.
[2024-06-14 14:52:25,390 INFO L231 Difference]: Finished difference. Result has 108 places, 97 transitions, 957 flow
[2024-06-14 14:52:25,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=957, PETRI_PLACES=108, PETRI_TRANSITIONS=97}
[2024-06-14 14:52:25,391 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 78 predicate places.
[2024-06-14 14:52:25,391 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 97 transitions, 957 flow
[2024-06-14 14:52:25,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:25,392 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:25,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:25,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-14 14:52:25,392 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:52:25,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:25,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1480278967, now seen corresponding path program 1 times
[2024-06-14 14:52:25,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:25,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738179650]
[2024-06-14 14:52:25,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:25,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:29,755 INFO 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 14:52:29,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:29,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738179650]
[2024-06-14 14:52:29,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738179650] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:29,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:29,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:52:29,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088745593]
[2024-06-14 14:52:29,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:29,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:52:29,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:29,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:52:29,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:52:29,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:52:29,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 97 transitions, 957 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:29,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:29,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:52:29,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:30,196 INFO L124 PetriNetUnfolderBase]: 319/566 cut-off events.
[2024-06-14 14:52:30,196 INFO L125 PetriNetUnfolderBase]: For 6434/6434 co-relation queries the response was YES.
[2024-06-14 14:52:30,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3026 conditions, 566 events. 319/566 cut-off events. For 6434/6434 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2311 event pairs, 103 based on Foata normal form. 2/568 useless extension candidates. Maximal degree in co-relation 2972. Up to 534 conditions per place.
[2024-06-14 14:52:30,212 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 93 selfloop transitions, 13 changer transitions 0/108 dead transitions.
[2024-06-14 14:52:30,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 108 transitions, 1207 flow
[2024-06-14 14:52:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-06-14 14:52:30,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:52:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions.
[2024-06-14 14:52:30,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588709677419355
[2024-06-14 14:52:30,215 INFO L175 Difference]: Start difference. First operand has 108 places, 97 transitions, 957 flow. Second operand 8 states and 89 transitions.
[2024-06-14 14:52:30,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 108 transitions, 1207 flow
[2024-06-14 14:52:30,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 108 transitions, 1172 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-14 14:52:30,225 INFO L231 Difference]: Finished difference. Result has 110 places, 99 transitions, 975 flow
[2024-06-14 14:52:30,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=975, PETRI_PLACES=110, PETRI_TRANSITIONS=99}
[2024-06-14 14:52:30,225 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 80 predicate places.
[2024-06-14 14:52:30,225 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 99 transitions, 975 flow
[2024-06-14 14:52:30,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:30,225 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:30,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:30,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-14 14:52:30,226 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:52:30,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:30,226 INFO L85 PathProgramCache]: Analyzing trace with hash 278017642, now seen corresponding path program 6 times
[2024-06-14 14:52:30,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:30,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040831254]
[2024-06-14 14:52:30,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:30,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:52:34,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:34,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040831254]
[2024-06-14 14:52:34,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040831254] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:34,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:34,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:52:34,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592141610]
[2024-06-14 14:52:34,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:34,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:52:34,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:34,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:52:34,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:52:34,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:52:34,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 99 transitions, 975 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:34,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:34,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:52:34,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:35,112 INFO L124 PetriNetUnfolderBase]: 313/557 cut-off events.
[2024-06-14 14:52:35,113 INFO L125 PetriNetUnfolderBase]: For 6441/6441 co-relation queries the response was YES.
[2024-06-14 14:52:35,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2967 conditions, 557 events. 313/557 cut-off events. For 6441/6441 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2273 event pairs, 98 based on Foata normal form. 3/560 useless extension candidates. Maximal degree in co-relation 2912. Up to 505 conditions per place.
[2024-06-14 14:52:35,117 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 94 selfloop transitions, 17 changer transitions 0/113 dead transitions.
[2024-06-14 14:52:35,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 113 transitions, 1233 flow
[2024-06-14 14:52:35,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:52:35,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:52:35,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions.
[2024-06-14 14:52:35,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36917562724014336
[2024-06-14 14:52:35,118 INFO L175 Difference]: Start difference. First operand has 110 places, 99 transitions, 975 flow. Second operand 9 states and 103 transitions.
[2024-06-14 14:52:35,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 113 transitions, 1233 flow
[2024-06-14 14:52:35,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 1187 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-14 14:52:35,129 INFO L231 Difference]: Finished difference. Result has 113 places, 99 transitions, 968 flow
[2024-06-14 14:52:35,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=968, PETRI_PLACES=113, PETRI_TRANSITIONS=99}
[2024-06-14 14:52:35,130 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 83 predicate places.
[2024-06-14 14:52:35,130 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 99 transitions, 968 flow
[2024-06-14 14:52:35,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:35,130 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:35,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:35,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-14 14:52:35,130 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:52:35,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:35,131 INFO L85 PathProgramCache]: Analyzing trace with hash 285646339, now seen corresponding path program 1 times
[2024-06-14 14:52:35,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:35,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097921698]
[2024-06-14 14:52:35,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:35,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:52:41,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:41,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097921698]
[2024-06-14 14:52:41,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097921698] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:41,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:41,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:52:41,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086756409]
[2024-06-14 14:52:41,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:41,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:52:41,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:41,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:52:41,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:52:41,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:52:41,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 99 transitions, 968 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:52:41,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:41,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:52:41,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:41,848 INFO L124 PetriNetUnfolderBase]: 310/552 cut-off events.
[2024-06-14 14:52:41,848 INFO L125 PetriNetUnfolderBase]: For 6554/6554 co-relation queries the response was YES.
[2024-06-14 14:52:41,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2931 conditions, 552 events. 310/552 cut-off events. For 6554/6554 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2231 event pairs, 100 based on Foata normal form. 2/554 useless extension candidates. Maximal degree in co-relation 2875. Up to 522 conditions per place.
[2024-06-14 14:52:41,852 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 94 selfloop transitions, 12 changer transitions 0/108 dead transitions.
[2024-06-14 14:52:41,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 108 transitions, 1200 flow
[2024-06-14 14:52:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-06-14 14:52:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:52:41,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions.
[2024-06-14 14:52:41,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35080645161290325
[2024-06-14 14:52:41,854 INFO L175 Difference]: Start difference. First operand has 113 places, 99 transitions, 968 flow. Second operand 8 states and 87 transitions.
[2024-06-14 14:52:41,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 108 transitions, 1200 flow
[2024-06-14 14:52:41,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 108 transitions, 1108 flow, removed 5 selfloop flow, removed 9 redundant places.
[2024-06-14 14:52:41,865 INFO L231 Difference]: Finished difference. Result has 112 places, 99 transitions, 904 flow
[2024-06-14 14:52:41,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=904, PETRI_PLACES=112, PETRI_TRANSITIONS=99}
[2024-06-14 14:52:41,865 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 82 predicate places.
[2024-06-14 14:52:41,865 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 99 transitions, 904 flow
[2024-06-14 14:52:41,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:52:41,866 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:41,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:41,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-14 14:52:41,866 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:52:41,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:41,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1315474289, now seen corresponding path program 1 times
[2024-06-14 14:52:41,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:41,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584615520]
[2024-06-14 14:52:41,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:41,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:48,132 INFO 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 14:52:48,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:48,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584615520]
[2024-06-14 14:52:48,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584615520] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:48,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:48,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:52:48,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228540435]
[2024-06-14 14:52:48,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:48,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:52:48,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:48,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:52:48,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:52:48,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:52:48,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 99 transitions, 904 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:52:48,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:48,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:52:48,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:48,559 INFO L124 PetriNetUnfolderBase]: 330/594 cut-off events.
[2024-06-14 14:52:48,559 INFO L125 PetriNetUnfolderBase]: For 7329/7329 co-relation queries the response was YES.
[2024-06-14 14:52:48,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3070 conditions, 594 events. 330/594 cut-off events. For 7329/7329 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2529 event pairs, 64 based on Foata normal form. 2/596 useless extension candidates. Maximal degree in co-relation 3013. Up to 473 conditions per place.
[2024-06-14 14:52:48,563 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 89 selfloop transitions, 28 changer transitions 0/119 dead transitions.
[2024-06-14 14:52:48,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 119 transitions, 1258 flow
[2024-06-14 14:52:48,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:52:48,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:52:48,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions.
[2024-06-14 14:52:48,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3942652329749104
[2024-06-14 14:52:48,565 INFO L175 Difference]: Start difference. First operand has 112 places, 99 transitions, 904 flow. Second operand 9 states and 110 transitions.
[2024-06-14 14:52:48,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 119 transitions, 1258 flow
[2024-06-14 14:52:48,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 119 transitions, 1225 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-06-14 14:52:48,575 INFO L231 Difference]: Finished difference. Result has 115 places, 103 transitions, 979 flow
[2024-06-14 14:52:48,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=979, PETRI_PLACES=115, PETRI_TRANSITIONS=103}
[2024-06-14 14:52:48,576 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 85 predicate places.
[2024-06-14 14:52:48,576 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 103 transitions, 979 flow
[2024-06-14 14:52:48,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:52:48,576 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:48,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:48,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-14 14:52:48,577 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:52:48,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:48,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1038420779, now seen corresponding path program 2 times
[2024-06-14 14:52:48,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:48,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418947353]
[2024-06-14 14:52:48,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:48,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:54,486 INFO 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 14:52:54,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:54,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418947353]
[2024-06-14 14:52:54,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418947353] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:54,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:54,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:52:54,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609759250]
[2024-06-14 14:52:54,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:54,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:52:54,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:54,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:52:54,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:52:54,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:52:54,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 103 transitions, 979 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:52:54,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:54,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:52:54,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:54,892 INFO L124 PetriNetUnfolderBase]: 334/602 cut-off events.
[2024-06-14 14:52:54,892 INFO L125 PetriNetUnfolderBase]: For 8078/8078 co-relation queries the response was YES.
[2024-06-14 14:52:54,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3209 conditions, 602 events. 334/602 cut-off events. For 8078/8078 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2579 event pairs, 68 based on Foata normal form. 2/604 useless extension candidates. Maximal degree in co-relation 3151. Up to 510 conditions per place.
[2024-06-14 14:52:54,896 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 89 selfloop transitions, 26 changer transitions 0/117 dead transitions.
[2024-06-14 14:52:54,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 117 transitions, 1260 flow
[2024-06-14 14:52:54,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:52:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:52:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions.
[2024-06-14 14:52:54,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674
[2024-06-14 14:52:54,899 INFO L175 Difference]: Start difference. First operand has 115 places, 103 transitions, 979 flow. Second operand 9 states and 107 transitions.
[2024-06-14 14:52:54,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 117 transitions, 1260 flow
[2024-06-14 14:52:54,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 117 transitions, 1204 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-14 14:52:54,912 INFO L231 Difference]: Finished difference. Result has 119 places, 104 transitions, 998 flow
[2024-06-14 14:52:54,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=998, PETRI_PLACES=119, PETRI_TRANSITIONS=104}
[2024-06-14 14:52:54,913 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 89 predicate places.
[2024-06-14 14:52:54,913 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 104 transitions, 998 flow
[2024-06-14 14:52:54,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:52:54,913 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:54,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:54,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-14 14:52:54,913 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:52:54,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:54,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1038420903, now seen corresponding path program 1 times
[2024-06-14 14:52:54,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:54,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50246240]
[2024-06-14 14:52:54,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:54,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:00,882 INFO 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 14:53:00,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:00,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50246240]
[2024-06-14 14:53:00,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50246240] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:00,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:00,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:53:00,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692958532]
[2024-06-14 14:53:00,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:00,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:53:00,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:00,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:53:00,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:53:00,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:53:00,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 104 transitions, 998 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:53:00,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:00,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:53:00,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:01,248 INFO L124 PetriNetUnfolderBase]: 342/615 cut-off events.
[2024-06-14 14:53:01,248 INFO L125 PetriNetUnfolderBase]: For 8684/8684 co-relation queries the response was YES.
[2024-06-14 14:53:01,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3312 conditions, 615 events. 342/615 cut-off events. For 8684/8684 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2649 event pairs, 64 based on Foata normal form. 1/616 useless extension candidates. Maximal degree in co-relation 3252. Up to 502 conditions per place.
[2024-06-14 14:53:01,252 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 94 selfloop transitions, 31 changer transitions 0/127 dead transitions.
[2024-06-14 14:53:01,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 127 transitions, 1393 flow
[2024-06-14 14:53:01,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:53:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:53:01,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions.
[2024-06-14 14:53:01,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546
[2024-06-14 14:53:01,253 INFO L175 Difference]: Start difference. First operand has 119 places, 104 transitions, 998 flow. Second operand 10 states and 119 transitions.
[2024-06-14 14:53:01,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 127 transitions, 1393 flow
[2024-06-14 14:53:01,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 127 transitions, 1337 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-06-14 14:53:01,266 INFO L231 Difference]: Finished difference. Result has 123 places, 112 transitions, 1079 flow
[2024-06-14 14:53:01,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1079, PETRI_PLACES=123, PETRI_TRANSITIONS=112}
[2024-06-14 14:53:01,267 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 93 predicate places.
[2024-06-14 14:53:01,267 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 112 transitions, 1079 flow
[2024-06-14 14:53:01,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:53:01,267 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:01,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:01,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-14 14:53:01,267 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:53:01,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:01,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1413907473, now seen corresponding path program 2 times
[2024-06-14 14:53:01,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:01,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173381839]
[2024-06-14 14:53:01,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:01,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:07,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:53:07,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:07,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173381839]
[2024-06-14 14:53:07,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173381839] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:07,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:07,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:53:07,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068423216]
[2024-06-14 14:53:07,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:07,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:53:07,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:07,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:53:07,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:53:07,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:53:07,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 112 transitions, 1079 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:53:07,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:07,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:53:07,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:07,740 INFO L124 PetriNetUnfolderBase]: 345/620 cut-off events.
[2024-06-14 14:53:07,740 INFO L125 PetriNetUnfolderBase]: For 9323/9323 co-relation queries the response was YES.
[2024-06-14 14:53:07,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 620 events. 345/620 cut-off events. For 9323/9323 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2679 event pairs, 64 based on Foata normal form. 1/621 useless extension candidates. Maximal degree in co-relation 3378. Up to 536 conditions per place.
[2024-06-14 14:53:07,744 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 96 selfloop transitions, 30 changer transitions 0/128 dead transitions.
[2024-06-14 14:53:07,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 128 transitions, 1395 flow
[2024-06-14 14:53:07,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:53:07,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:53:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions.
[2024-06-14 14:53:07,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968
[2024-06-14 14:53:07,745 INFO L175 Difference]: Start difference. First operand has 123 places, 112 transitions, 1079 flow. Second operand 10 states and 116 transitions.
[2024-06-14 14:53:07,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 128 transitions, 1395 flow
[2024-06-14 14:53:07,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 128 transitions, 1347 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-14 14:53:07,761 INFO L231 Difference]: Finished difference. Result has 129 places, 116 transitions, 1140 flow
[2024-06-14 14:53:07,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1140, PETRI_PLACES=129, PETRI_TRANSITIONS=116}
[2024-06-14 14:53:07,761 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 99 predicate places.
[2024-06-14 14:53:07,762 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 116 transitions, 1140 flow
[2024-06-14 14:53:07,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:53:07,762 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:07,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:07,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-14 14:53:07,762 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:53:07,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:07,763 INFO L85 PathProgramCache]: Analyzing trace with hash 361154805, now seen corresponding path program 3 times
[2024-06-14 14:53:07,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:07,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688406556]
[2024-06-14 14:53:07,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:07,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:13,052 INFO 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 14:53:13,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:13,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688406556]
[2024-06-14 14:53:13,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688406556] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:13,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:13,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:53:13,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685339703]
[2024-06-14 14:53:13,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:13,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:53:13,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:13,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:53:13,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:53:13,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:53:13,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 116 transitions, 1140 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:53:13,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:13,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:53:13,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:13,563 INFO L124 PetriNetUnfolderBase]: 358/641 cut-off events.
[2024-06-14 14:53:13,563 INFO L125 PetriNetUnfolderBase]: For 10724/10724 co-relation queries the response was YES.
[2024-06-14 14:53:13,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 641 events. 358/641 cut-off events. For 10724/10724 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2813 event pairs, 57 based on Foata normal form. 1/642 useless extension candidates. Maximal degree in co-relation 3604. Up to 485 conditions per place.
[2024-06-14 14:53:13,568 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 99 selfloop transitions, 43 changer transitions 0/144 dead transitions.
[2024-06-14 14:53:13,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 144 transitions, 1605 flow
[2024-06-14 14:53:13,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:53:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:53:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions.
[2024-06-14 14:53:13,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4229390681003584
[2024-06-14 14:53:13,569 INFO L175 Difference]: Start difference. First operand has 129 places, 116 transitions, 1140 flow. Second operand 9 states and 118 transitions.
[2024-06-14 14:53:13,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 144 transitions, 1605 flow
[2024-06-14 14:53:13,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 144 transitions, 1544 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-06-14 14:53:13,585 INFO L231 Difference]: Finished difference. Result has 133 places, 126 transitions, 1288 flow
[2024-06-14 14:53:13,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1079, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1288, PETRI_PLACES=133, PETRI_TRANSITIONS=126}
[2024-06-14 14:53:13,586 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 103 predicate places.
[2024-06-14 14:53:13,586 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 126 transitions, 1288 flow
[2024-06-14 14:53:13,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:53:13,586 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:13,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:13,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-14 14:53:13,587 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:53:13,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:13,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1041217289, now seen corresponding path program 3 times
[2024-06-14 14:53:13,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:13,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971365704]
[2024-06-14 14:53:13,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:13,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:19,834 INFO 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 14:53:19,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:19,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971365704]
[2024-06-14 14:53:19,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971365704] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:19,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:19,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:53:19,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667446222]
[2024-06-14 14:53:19,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:19,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:53:19,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:19,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:53:19,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:53:19,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:53:19,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 126 transitions, 1288 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:53:19,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:19,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:53:19,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:20,331 INFO L124 PetriNetUnfolderBase]: 355/636 cut-off events.
[2024-06-14 14:53:20,331 INFO L125 PetriNetUnfolderBase]: For 11410/11410 co-relation queries the response was YES.
[2024-06-14 14:53:20,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3791 conditions, 636 events. 355/636 cut-off events. For 11410/11410 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2769 event pairs, 66 based on Foata normal form. 2/638 useless extension candidates. Maximal degree in co-relation 3723. Up to 558 conditions per place.
[2024-06-14 14:53:20,337 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 111 selfloop transitions, 25 changer transitions 0/138 dead transitions.
[2024-06-14 14:53:20,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 138 transitions, 1590 flow
[2024-06-14 14:53:20,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:53:20,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:53:20,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions.
[2024-06-14 14:53:20,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37992831541218636
[2024-06-14 14:53:20,338 INFO L175 Difference]: Start difference. First operand has 133 places, 126 transitions, 1288 flow. Second operand 9 states and 106 transitions.
[2024-06-14 14:53:20,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 138 transitions, 1590 flow
[2024-06-14 14:53:20,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 138 transitions, 1510 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-14 14:53:20,362 INFO L231 Difference]: Finished difference. Result has 137 places, 126 transitions, 1262 flow
[2024-06-14 14:53:20,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1262, PETRI_PLACES=137, PETRI_TRANSITIONS=126}
[2024-06-14 14:53:20,362 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 107 predicate places.
[2024-06-14 14:53:20,362 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 126 transitions, 1262 flow
[2024-06-14 14:53:20,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:53:20,362 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:20,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:20,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-14 14:53:20,363 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:53:20,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:20,363 INFO L85 PathProgramCache]: Analyzing trace with hash 88020173, now seen corresponding path program 4 times
[2024-06-14 14:53:20,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:20,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344643645]
[2024-06-14 14:53:20,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:20,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:26,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 14:53:26,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:26,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344643645]
[2024-06-14 14:53:26,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344643645] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:26,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:26,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:53:26,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805469082]
[2024-06-14 14:53:26,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:26,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:53:26,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:26,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:53:26,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:53:26,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:53:26,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 126 transitions, 1262 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:53:26,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:26,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:53:26,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:26,604 INFO L124 PetriNetUnfolderBase]: 364/655 cut-off events.
[2024-06-14 14:53:26,605 INFO L125 PetriNetUnfolderBase]: For 12208/12208 co-relation queries the response was YES.
[2024-06-14 14:53:26,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3817 conditions, 655 events. 364/655 cut-off events. For 12208/12208 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2902 event pairs, 47 based on Foata normal form. 2/657 useless extension candidates. Maximal degree in co-relation 3748. Up to 451 conditions per place.
[2024-06-14 14:53:26,609 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 101 selfloop transitions, 42 changer transitions 0/145 dead transitions.
[2024-06-14 14:53:26,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 145 transitions, 1666 flow
[2024-06-14 14:53:26,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:53:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:53:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions.
[2024-06-14 14:53:26,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674
[2024-06-14 14:53:26,611 INFO L175 Difference]: Start difference. First operand has 137 places, 126 transitions, 1262 flow. Second operand 9 states and 107 transitions.
[2024-06-14 14:53:26,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 145 transitions, 1666 flow
[2024-06-14 14:53:26,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 145 transitions, 1614 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-14 14:53:26,636 INFO L231 Difference]: Finished difference. Result has 140 places, 128 transitions, 1324 flow
[2024-06-14 14:53:26,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1324, PETRI_PLACES=140, PETRI_TRANSITIONS=128}
[2024-06-14 14:53:26,637 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 110 predicate places.
[2024-06-14 14:53:26,637 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 128 transitions, 1324 flow
[2024-06-14 14:53:26,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:53:26,637 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:26,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:26,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-14 14:53:26,638 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:53:26,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:26,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2076174569, now seen corresponding path program 5 times
[2024-06-14 14:53:26,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:26,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652772578]
[2024-06-14 14:53:26,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:26,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:32,713 INFO 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 14:53:32,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:32,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652772578]
[2024-06-14 14:53:32,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652772578] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:32,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:32,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:53:32,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839879224]
[2024-06-14 14:53:32,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:32,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:53:32,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:32,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:53:32,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:53:32,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:53:32,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 128 transitions, 1324 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:53:32,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:32,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:53:32,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:33,110 INFO L124 PetriNetUnfolderBase]: 380/687 cut-off events.
[2024-06-14 14:53:33,110 INFO L125 PetriNetUnfolderBase]: For 14123/14123 co-relation queries the response was YES.
[2024-06-14 14:53:33,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4124 conditions, 687 events. 380/687 cut-off events. For 14123/14123 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3123 event pairs, 70 based on Foata normal form. 2/689 useless extension candidates. Maximal degree in co-relation 4053. Up to 551 conditions per place.
[2024-06-14 14:53:33,115 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 109 selfloop transitions, 37 changer transitions 0/148 dead transitions.
[2024-06-14 14:53:33,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 148 transitions, 1760 flow
[2024-06-14 14:53:33,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:53:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:53:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions.
[2024-06-14 14:53:33,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914
[2024-06-14 14:53:33,116 INFO L175 Difference]: Start difference. First operand has 140 places, 128 transitions, 1324 flow. Second operand 9 states and 111 transitions.
[2024-06-14 14:53:33,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 148 transitions, 1760 flow
[2024-06-14 14:53:33,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 148 transitions, 1658 flow, removed 20 selfloop flow, removed 6 redundant places.
[2024-06-14 14:53:33,142 INFO L231 Difference]: Finished difference. Result has 144 places, 131 transitions, 1352 flow
[2024-06-14 14:53:33,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1236, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1352, PETRI_PLACES=144, PETRI_TRANSITIONS=131}
[2024-06-14 14:53:33,142 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 114 predicate places.
[2024-06-14 14:53:33,142 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 131 transitions, 1352 flow
[2024-06-14 14:53:33,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:53:33,142 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:33,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:33,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-14 14:53:33,143 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:53:33,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:33,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2088271203, now seen corresponding path program 4 times
[2024-06-14 14:53:33,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:33,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590197317]
[2024-06-14 14:53:33,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:33,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:39,220 INFO 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 14:53:39,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:39,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590197317]
[2024-06-14 14:53:39,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590197317] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:39,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:39,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:53:39,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321180707]
[2024-06-14 14:53:39,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:39,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:53:39,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:39,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:53:39,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:53:39,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:53:39,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 131 transitions, 1352 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:53:39,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:39,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:53:39,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:39,655 INFO L124 PetriNetUnfolderBase]: 383/692 cut-off events.
[2024-06-14 14:53:39,655 INFO L125 PetriNetUnfolderBase]: For 14305/14305 co-relation queries the response was YES.
[2024-06-14 14:53:39,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4106 conditions, 692 events. 383/692 cut-off events. For 14305/14305 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3151 event pairs, 75 based on Foata normal form. 1/693 useless extension candidates. Maximal degree in co-relation 4035. Up to 580 conditions per place.
[2024-06-14 14:53:39,660 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 107 selfloop transitions, 37 changer transitions 0/146 dead transitions.
[2024-06-14 14:53:39,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 146 transitions, 1696 flow
[2024-06-14 14:53:39,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:53:39,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:53:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions.
[2024-06-14 14:53:39,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674
[2024-06-14 14:53:39,669 INFO L175 Difference]: Start difference. First operand has 144 places, 131 transitions, 1352 flow. Second operand 9 states and 107 transitions.
[2024-06-14 14:53:39,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 146 transitions, 1696 flow
[2024-06-14 14:53:39,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 146 transitions, 1608 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-06-14 14:53:39,696 INFO L231 Difference]: Finished difference. Result has 147 places, 133 transitions, 1369 flow
[2024-06-14 14:53:39,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1369, PETRI_PLACES=147, PETRI_TRANSITIONS=133}
[2024-06-14 14:53:39,696 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 117 predicate places.
[2024-06-14 14:53:39,697 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 133 transitions, 1369 flow
[2024-06-14 14:53:39,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:53:39,697 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:39,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:39,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-14 14:53:39,697 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:53:39,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:39,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2088267359, now seen corresponding path program 6 times
[2024-06-14 14:53:39,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:39,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796694143]
[2024-06-14 14:53:39,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:39,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:45,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:53:45,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:45,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796694143]
[2024-06-14 14:53:45,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796694143] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:45,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:45,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:53:45,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739890018]
[2024-06-14 14:53:45,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:45,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:53:45,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:45,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:53:45,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:53:46,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:53:46,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 133 transitions, 1369 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:53:46,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:46,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:53:46,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:46,386 INFO L124 PetriNetUnfolderBase]: 380/687 cut-off events.
[2024-06-14 14:53:46,386 INFO L125 PetriNetUnfolderBase]: For 14629/14629 co-relation queries the response was YES.
[2024-06-14 14:53:46,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4043 conditions, 687 events. 380/687 cut-off events. For 14629/14629 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3135 event pairs, 73 based on Foata normal form. 2/689 useless extension candidates. Maximal degree in co-relation 3972. Up to 572 conditions per place.
[2024-06-14 14:53:46,391 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 109 selfloop transitions, 36 changer transitions 0/147 dead transitions.
[2024-06-14 14:53:46,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 147 transitions, 1695 flow
[2024-06-14 14:53:46,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:53:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:53:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions.
[2024-06-14 14:53:46,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674
[2024-06-14 14:53:46,394 INFO L175 Difference]: Start difference. First operand has 147 places, 133 transitions, 1369 flow. Second operand 9 states and 107 transitions.
[2024-06-14 14:53:46,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 147 transitions, 1695 flow
[2024-06-14 14:53:46,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 147 transitions, 1575 flow, removed 15 selfloop flow, removed 8 redundant places.
[2024-06-14 14:53:46,422 INFO L231 Difference]: Finished difference. Result has 148 places, 133 transitions, 1325 flow
[2024-06-14 14:53:46,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1249, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1325, PETRI_PLACES=148, PETRI_TRANSITIONS=133}
[2024-06-14 14:53:46,423 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 118 predicate places.
[2024-06-14 14:53:46,423 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 133 transitions, 1325 flow
[2024-06-14 14:53:46,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:53:46,423 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:46,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:46,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-14 14:53:46,423 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:53:46,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:46,423 INFO L85 PathProgramCache]: Analyzing trace with hash -863968079, now seen corresponding path program 5 times
[2024-06-14 14:53:46,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:46,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670129877]
[2024-06-14 14:53:46,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:46,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:52,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:53:52,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:52,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670129877]
[2024-06-14 14:53:52,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670129877] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:52,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:52,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:53:52,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318232831]
[2024-06-14 14:53:52,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:52,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:53:52,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:52,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:53:52,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:53:52,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:53:52,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 133 transitions, 1325 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:53:52,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:52,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:53:52,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:53,337 INFO L124 PetriNetUnfolderBase]: 387/699 cut-off events.
[2024-06-14 14:53:53,337 INFO L125 PetriNetUnfolderBase]: For 14717/14717 co-relation queries the response was YES.
[2024-06-14 14:53:53,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4074 conditions, 699 events. 387/699 cut-off events. For 14717/14717 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3181 event pairs, 77 based on Foata normal form. 1/700 useless extension candidates. Maximal degree in co-relation 4003. Up to 601 conditions per place.
[2024-06-14 14:53:53,342 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 117 selfloop transitions, 34 changer transitions 0/153 dead transitions.
[2024-06-14 14:53:53,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 153 transitions, 1780 flow
[2024-06-14 14:53:53,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 14:53:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 14:53:53,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions.
[2024-06-14 14:53:53,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522
[2024-06-14 14:53:53,350 INFO L175 Difference]: Start difference. First operand has 148 places, 133 transitions, 1325 flow. Second operand 11 states and 130 transitions.
[2024-06-14 14:53:53,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 153 transitions, 1780 flow
[2024-06-14 14:53:53,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 153 transitions, 1706 flow, removed 1 selfloop flow, removed 7 redundant places.
[2024-06-14 14:53:53,379 INFO L231 Difference]: Finished difference. Result has 153 places, 137 transitions, 1385 flow
[2024-06-14 14:53:53,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1253, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1385, PETRI_PLACES=153, PETRI_TRANSITIONS=137}
[2024-06-14 14:53:53,380 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 123 predicate places.
[2024-06-14 14:53:53,380 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 137 transitions, 1385 flow
[2024-06-14 14:53:53,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:53:53,380 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:53,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:53,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-14 14:53:53,381 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:53:53,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:53,381 INFO L85 PathProgramCache]: Analyzing trace with hash -863790449, now seen corresponding path program 6 times
[2024-06-14 14:53:53,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:53,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068510427]
[2024-06-14 14:53:53,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:53,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:59,655 INFO 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 14:53:59,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:59,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068510427]
[2024-06-14 14:53:59,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068510427] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:59,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:59,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:53:59,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496628190]
[2024-06-14 14:53:59,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:59,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:53:59,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:59,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:53:59,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:53:59,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:53:59,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 137 transitions, 1385 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:59,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:59,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:53:59,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:00,223 INFO L124 PetriNetUnfolderBase]: 390/705 cut-off events.
[2024-06-14 14:54:00,223 INFO L125 PetriNetUnfolderBase]: For 15657/15657 co-relation queries the response was YES.
[2024-06-14 14:54:00,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4156 conditions, 705 events. 390/705 cut-off events. For 15657/15657 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3220 event pairs, 78 based on Foata normal form. 1/706 useless extension candidates. Maximal degree in co-relation 4083. Up to 620 conditions per place.
[2024-06-14 14:54:00,229 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 120 selfloop transitions, 31 changer transitions 0/153 dead transitions.
[2024-06-14 14:54:00,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 153 transitions, 1754 flow
[2024-06-14 14:54:00,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 14:54:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 14:54:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions.
[2024-06-14 14:54:00,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36656891495601174
[2024-06-14 14:54:00,230 INFO L175 Difference]: Start difference. First operand has 153 places, 137 transitions, 1385 flow. Second operand 11 states and 125 transitions.
[2024-06-14 14:54:00,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 153 transitions, 1754 flow
[2024-06-14 14:54:00,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 153 transitions, 1658 flow, removed 7 selfloop flow, removed 9 redundant places.
[2024-06-14 14:54:00,262 INFO L231 Difference]: Finished difference. Result has 155 places, 140 transitions, 1395 flow
[2024-06-14 14:54:00,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1395, PETRI_PLACES=155, PETRI_TRANSITIONS=140}
[2024-06-14 14:54:00,263 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 125 predicate places.
[2024-06-14 14:54:00,263 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 140 transitions, 1395 flow
[2024-06-14 14:54:00,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:00,263 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:00,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:00,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-14 14:54:00,263 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:54:00,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:00,264 INFO L85 PathProgramCache]: Analyzing trace with hash 184315939, now seen corresponding path program 7 times
[2024-06-14 14:54:00,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:00,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583176893]
[2024-06-14 14:54:00,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:00,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:06,406 INFO 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 14:54:06,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:06,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583176893]
[2024-06-14 14:54:06,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583176893] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:06,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:06,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:54:06,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918020165]
[2024-06-14 14:54:06,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:06,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:54:06,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:06,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:54:06,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:54:06,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:54:06,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 140 transitions, 1395 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:54:06,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:06,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:54:06,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:06,892 INFO L124 PetriNetUnfolderBase]: 388/701 cut-off events.
[2024-06-14 14:54:06,893 INFO L125 PetriNetUnfolderBase]: For 15934/15934 co-relation queries the response was YES.
[2024-06-14 14:54:06,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4103 conditions, 701 events. 388/701 cut-off events. For 15934/15934 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3218 event pairs, 75 based on Foata normal form. 1/702 useless extension candidates. Maximal degree in co-relation 4029. Up to 617 conditions per place.
[2024-06-14 14:54:06,899 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 122 selfloop transitions, 30 changer transitions 0/154 dead transitions.
[2024-06-14 14:54:06,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 154 transitions, 1735 flow
[2024-06-14 14:54:06,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 14:54:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 14:54:06,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions.
[2024-06-14 14:54:06,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36950146627565983
[2024-06-14 14:54:06,905 INFO L175 Difference]: Start difference. First operand has 155 places, 140 transitions, 1395 flow. Second operand 11 states and 126 transitions.
[2024-06-14 14:54:06,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 154 transitions, 1735 flow
[2024-06-14 14:54:06,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 154 transitions, 1652 flow, removed 12 selfloop flow, removed 8 redundant places.
[2024-06-14 14:54:06,940 INFO L231 Difference]: Finished difference. Result has 158 places, 140 transitions, 1377 flow
[2024-06-14 14:54:06,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1377, PETRI_PLACES=158, PETRI_TRANSITIONS=140}
[2024-06-14 14:54:06,940 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 128 predicate places.
[2024-06-14 14:54:06,941 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 140 transitions, 1377 flow
[2024-06-14 14:54:06,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:54:06,941 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:06,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:06,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-14 14:54:06,941 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:54:06,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:06,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1485588375, now seen corresponding path program 7 times
[2024-06-14 14:54:06,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:06,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859159860]
[2024-06-14 14:54:06,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:06,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:54:12,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:12,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859159860]
[2024-06-14 14:54:12,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859159860] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:12,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:12,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:54:12,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253681073]
[2024-06-14 14:54:12,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:12,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:54:12,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:12,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:54:12,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:54:12,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:54:12,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 140 transitions, 1377 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:54:12,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:12,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:54:12,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:13,157 INFO L124 PetriNetUnfolderBase]: 392/709 cut-off events.
[2024-06-14 14:54:13,157 INFO L125 PetriNetUnfolderBase]: For 17406/17406 co-relation queries the response was YES.
[2024-06-14 14:54:13,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4146 conditions, 709 events. 392/709 cut-off events. For 17406/17406 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3250 event pairs, 46 based on Foata normal form. 2/711 useless extension candidates. Maximal degree in co-relation 4071. Up to 475 conditions per place.
[2024-06-14 14:54:13,163 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 105 selfloop transitions, 48 changer transitions 0/155 dead transitions.
[2024-06-14 14:54:13,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 155 transitions, 1798 flow
[2024-06-14 14:54:13,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-06-14 14:54:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:54:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions.
[2024-06-14 14:54:13,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645
[2024-06-14 14:54:13,165 INFO L175 Difference]: Start difference. First operand has 158 places, 140 transitions, 1377 flow. Second operand 8 states and 97 transitions.
[2024-06-14 14:54:13,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 155 transitions, 1798 flow
[2024-06-14 14:54:13,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 155 transitions, 1716 flow, removed 4 selfloop flow, removed 10 redundant places.
[2024-06-14 14:54:13,197 INFO L231 Difference]: Finished difference. Result has 156 places, 141 transitions, 1414 flow
[2024-06-14 14:54:13,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1414, PETRI_PLACES=156, PETRI_TRANSITIONS=141}
[2024-06-14 14:54:13,198 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 126 predicate places.
[2024-06-14 14:54:13,198 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 141 transitions, 1414 flow
[2024-06-14 14:54:13,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:54:13,198 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:13,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:13,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-14 14:54:13,199 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:54:13,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:13,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1485648825, now seen corresponding path program 8 times
[2024-06-14 14:54:13,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:13,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951943771]
[2024-06-14 14:54:13,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:13,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:18,629 INFO 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 14:54:18,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:18,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951943771]
[2024-06-14 14:54:18,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951943771] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:18,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:18,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:54:18,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360386471]
[2024-06-14 14:54:18,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:18,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:54:18,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:18,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:54:18,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:54:18,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:54:18,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 141 transitions, 1414 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:54:18,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:18,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:54:18,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:19,010 INFO L124 PetriNetUnfolderBase]: 396/718 cut-off events.
[2024-06-14 14:54:19,010 INFO L125 PetriNetUnfolderBase]: For 18623/18623 co-relation queries the response was YES.
[2024-06-14 14:54:19,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4250 conditions, 718 events. 396/718 cut-off events. For 18623/18623 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3326 event pairs, 73 based on Foata normal form. 2/720 useless extension candidates. Maximal degree in co-relation 4175. Up to 586 conditions per place.
[2024-06-14 14:54:19,015 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 111 selfloop transitions, 41 changer transitions 0/154 dead transitions.
[2024-06-14 14:54:19,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 154 transitions, 1763 flow
[2024-06-14 14:54:19,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-06-14 14:54:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:54:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions.
[2024-06-14 14:54:19,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645
[2024-06-14 14:54:19,017 INFO L175 Difference]: Start difference. First operand has 156 places, 141 transitions, 1414 flow. Second operand 8 states and 97 transitions.
[2024-06-14 14:54:19,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 154 transitions, 1763 flow
[2024-06-14 14:54:19,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 154 transitions, 1676 flow, removed 6 selfloop flow, removed 8 redundant places.
[2024-06-14 14:54:19,054 INFO L231 Difference]: Finished difference. Result has 156 places, 142 transitions, 1434 flow
[2024-06-14 14:54:19,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1434, PETRI_PLACES=156, PETRI_TRANSITIONS=142}
[2024-06-14 14:54:19,054 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 126 predicate places.
[2024-06-14 14:54:19,054 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 142 transitions, 1434 flow
[2024-06-14 14:54:19,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:54:19,055 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:19,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:19,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-14 14:54:19,055 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:54:19,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:19,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1325262207, now seen corresponding path program 8 times
[2024-06-14 14:54:19,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:19,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467080309]
[2024-06-14 14:54:19,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:19,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:23,931 INFO 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 14:54:23,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:23,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467080309]
[2024-06-14 14:54:23,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467080309] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:23,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:23,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:54:23,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83498011]
[2024-06-14 14:54:23,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:23,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:54:23,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:23,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:54:23,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:54:24,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:54:24,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 142 transitions, 1434 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:54:24,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:24,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:54:24,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:24,363 INFO L124 PetriNetUnfolderBase]: 399/723 cut-off events.
[2024-06-14 14:54:24,363 INFO L125 PetriNetUnfolderBase]: For 16351/16351 co-relation queries the response was YES.
[2024-06-14 14:54:24,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4224 conditions, 723 events. 399/723 cut-off events. For 16351/16351 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3379 event pairs, 62 based on Foata normal form. 1/724 useless extension candidates. Maximal degree in co-relation 4151. Up to 530 conditions per place.
[2024-06-14 14:54:24,368 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 99 selfloop transitions, 61 changer transitions 0/162 dead transitions.
[2024-06-14 14:54:24,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 162 transitions, 1920 flow
[2024-06-14 14:54:24,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:54:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:54:24,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions.
[2024-06-14 14:54:24,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294
[2024-06-14 14:54:24,370 INFO L175 Difference]: Start difference. First operand has 156 places, 142 transitions, 1434 flow. Second operand 9 states and 109 transitions.
[2024-06-14 14:54:24,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 162 transitions, 1920 flow
[2024-06-14 14:54:24,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 162 transitions, 1826 flow, removed 7 selfloop flow, removed 8 redundant places.
[2024-06-14 14:54:24,402 INFO L231 Difference]: Finished difference. Result has 157 places, 146 transitions, 1529 flow
[2024-06-14 14:54:24,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1529, PETRI_PLACES=157, PETRI_TRANSITIONS=146}
[2024-06-14 14:54:24,403 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 127 predicate places.
[2024-06-14 14:54:24,403 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 146 transitions, 1529 flow
[2024-06-14 14:54:24,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:54:24,403 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:24,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:24,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-14 14:54:24,403 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:54:24,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:24,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1328063367, now seen corresponding path program 9 times
[2024-06-14 14:54:24,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:24,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835893300]
[2024-06-14 14:54:24,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:24,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:30,060 INFO 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 14:54:30,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:30,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835893300]
[2024-06-14 14:54:30,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835893300] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:30,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:30,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:54:30,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870330581]
[2024-06-14 14:54:30,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:30,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:54:30,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:30,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:54:30,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:54:30,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:54:30,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 146 transitions, 1529 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:54:30,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:30,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:54:30,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:30,487 INFO L124 PetriNetUnfolderBase]: 402/728 cut-off events.
[2024-06-14 14:54:30,488 INFO L125 PetriNetUnfolderBase]: For 15606/15606 co-relation queries the response was YES.
[2024-06-14 14:54:30,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4296 conditions, 728 events. 402/728 cut-off events. For 15606/15606 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3398 event pairs, 68 based on Foata normal form. 1/729 useless extension candidates. Maximal degree in co-relation 4224. Up to 613 conditions per place.
[2024-06-14 14:54:30,493 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 118 selfloop transitions, 42 changer transitions 0/162 dead transitions.
[2024-06-14 14:54:30,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 162 transitions, 1929 flow
[2024-06-14 14:54:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:54:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:54:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions.
[2024-06-14 14:54:30,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054
[2024-06-14 14:54:30,494 INFO L175 Difference]: Start difference. First operand has 157 places, 146 transitions, 1529 flow. Second operand 9 states and 105 transitions.
[2024-06-14 14:54:30,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 162 transitions, 1929 flow
[2024-06-14 14:54:30,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 162 transitions, 1854 flow, removed 13 selfloop flow, removed 7 redundant places.
[2024-06-14 14:54:30,527 INFO L231 Difference]: Finished difference. Result has 160 places, 150 transitions, 1604 flow
[2024-06-14 14:54:30,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1604, PETRI_PLACES=160, PETRI_TRANSITIONS=150}
[2024-06-14 14:54:30,528 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 130 predicate places.
[2024-06-14 14:54:30,528 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 150 transitions, 1604 flow
[2024-06-14 14:54:30,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:54:30,528 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:30,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:30,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-14 14:54:30,529 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:54:30,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:30,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1328058593, now seen corresponding path program 9 times
[2024-06-14 14:54:30,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:30,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531477885]
[2024-06-14 14:54:30,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:30,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:35,719 INFO 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 14:54:35,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:35,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531477885]
[2024-06-14 14:54:35,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531477885] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:35,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:35,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:54:35,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548158050]
[2024-06-14 14:54:35,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:35,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:54:35,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:35,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:54:35,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:54:35,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:54:35,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 150 transitions, 1604 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:54:35,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:35,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:54:35,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:36,103 INFO L124 PetriNetUnfolderBase]: 399/723 cut-off events.
[2024-06-14 14:54:36,103 INFO L125 PetriNetUnfolderBase]: For 14973/14973 co-relation queries the response was YES.
[2024-06-14 14:54:36,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4284 conditions, 723 events. 399/723 cut-off events. For 14973/14973 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3350 event pairs, 73 based on Foata normal form. 2/725 useless extension candidates. Maximal degree in co-relation 4211. Up to 635 conditions per place.
[2024-06-14 14:54:36,108 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 128 selfloop transitions, 30 changer transitions 0/160 dead transitions.
[2024-06-14 14:54:36,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 160 transitions, 1944 flow
[2024-06-14 14:54:36,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-06-14 14:54:36,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:54:36,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions.
[2024-06-14 14:54:36,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161
[2024-06-14 14:54:36,111 INFO L175 Difference]: Start difference. First operand has 160 places, 150 transitions, 1604 flow. Second operand 8 states and 94 transitions.
[2024-06-14 14:54:36,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 160 transitions, 1944 flow
[2024-06-14 14:54:36,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 160 transitions, 1881 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-06-14 14:54:36,143 INFO L231 Difference]: Finished difference. Result has 162 places, 150 transitions, 1607 flow
[2024-06-14 14:54:36,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1541, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1607, PETRI_PLACES=162, PETRI_TRANSITIONS=150}
[2024-06-14 14:54:36,144 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 132 predicate places.
[2024-06-14 14:54:36,144 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 150 transitions, 1607 flow
[2024-06-14 14:54:36,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:54:36,144 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:36,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:36,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-14 14:54:36,144 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:54:36,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:36,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1488445459, now seen corresponding path program 10 times
[2024-06-14 14:54:36,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:36,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594771606]
[2024-06-14 14:54:36,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:36,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:54:41,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:41,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594771606]
[2024-06-14 14:54:41,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594771606] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:41,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:41,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:54:41,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278245318]
[2024-06-14 14:54:41,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:41,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:54:41,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:41,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:54:41,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:54:41,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:54:41,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 150 transitions, 1607 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:54:41,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:41,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:54:41,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:41,721 INFO L124 PetriNetUnfolderBase]: 402/728 cut-off events.
[2024-06-14 14:54:41,721 INFO L125 PetriNetUnfolderBase]: For 14624/14624 co-relation queries the response was YES.
[2024-06-14 14:54:41,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4299 conditions, 728 events. 402/728 cut-off events. For 14624/14624 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3399 event pairs, 67 based on Foata normal form. 1/729 useless extension candidates. Maximal degree in co-relation 4226. Up to 601 conditions per place.
[2024-06-14 14:54:41,726 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 114 selfloop transitions, 48 changer transitions 0/164 dead transitions.
[2024-06-14 14:54:41,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 164 transitions, 1995 flow
[2024-06-14 14:54:41,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:54:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:54:41,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions.
[2024-06-14 14:54:41,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37992831541218636
[2024-06-14 14:54:41,728 INFO L175 Difference]: Start difference. First operand has 162 places, 150 transitions, 1607 flow. Second operand 9 states and 106 transitions.
[2024-06-14 14:54:41,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 164 transitions, 1995 flow
[2024-06-14 14:54:41,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 164 transitions, 1908 flow, removed 4 selfloop flow, removed 8 redundant places.
[2024-06-14 14:54:41,762 INFO L231 Difference]: Finished difference. Result has 163 places, 152 transitions, 1656 flow
[2024-06-14 14:54:41,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1656, PETRI_PLACES=163, PETRI_TRANSITIONS=152}
[2024-06-14 14:54:41,762 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 133 predicate places.
[2024-06-14 14:54:41,762 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 152 transitions, 1656 flow
[2024-06-14 14:54:41,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:54:41,763 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:41,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:41,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-14 14:54:41,763 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:54:41,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:41,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1603736629, now seen corresponding path program 11 times
[2024-06-14 14:54:41,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:41,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361511106]
[2024-06-14 14:54:41,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:41,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:47,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 14:54:47,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:47,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361511106]
[2024-06-14 14:54:47,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361511106] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:47,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:47,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:54:47,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595181443]
[2024-06-14 14:54:47,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:47,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:54:47,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:47,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:54:47,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:54:47,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:54:47,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 152 transitions, 1656 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:54:47,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:47,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:54:47,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:48,057 INFO L124 PetriNetUnfolderBase]: 421/758 cut-off events.
[2024-06-14 14:54:48,057 INFO L125 PetriNetUnfolderBase]: For 16651/16651 co-relation queries the response was YES.
[2024-06-14 14:54:48,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4548 conditions, 758 events. 421/758 cut-off events. For 16651/16651 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3569 event pairs, 65 based on Foata normal form. 3/761 useless extension candidates. Maximal degree in co-relation 4475. Up to 478 conditions per place.
[2024-06-14 14:54:48,063 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 99 selfloop transitions, 81 changer transitions 0/182 dead transitions.
[2024-06-14 14:54:48,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 182 transitions, 2241 flow
[2024-06-14 14:54:48,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:54:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:54:48,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions.
[2024-06-14 14:54:48,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4290322580645161
[2024-06-14 14:54:48,065 INFO L175 Difference]: Start difference. First operand has 163 places, 152 transitions, 1656 flow. Second operand 10 states and 133 transitions.
[2024-06-14 14:54:48,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 182 transitions, 2241 flow
[2024-06-14 14:54:48,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 182 transitions, 2124 flow, removed 10 selfloop flow, removed 8 redundant places.
[2024-06-14 14:54:48,097 INFO L231 Difference]: Finished difference. Result has 165 places, 158 transitions, 1807 flow
[2024-06-14 14:54:48,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1545, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1807, PETRI_PLACES=165, PETRI_TRANSITIONS=158}
[2024-06-14 14:54:48,098 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 135 predicate places.
[2024-06-14 14:54:48,098 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 158 transitions, 1807 flow
[2024-06-14 14:54:48,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 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 14:54:48,098 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:48,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:48,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-14 14:54:48,098 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:54:48,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:48,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1603914259, now seen corresponding path program 12 times
[2024-06-14 14:54:48,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:48,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752350933]
[2024-06-14 14:54:48,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:48,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:53,716 INFO 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 14:54:53,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:53,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752350933]
[2024-06-14 14:54:53,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752350933] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:53,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:53,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:54:53,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483594397]
[2024-06-14 14:54:53,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:53,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:54:53,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:53,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:54:53,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:54:53,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:54:53,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 158 transitions, 1807 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:53,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:53,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:54:53,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:54,210 INFO L124 PetriNetUnfolderBase]: 424/764 cut-off events.
[2024-06-14 14:54:54,210 INFO L125 PetriNetUnfolderBase]: For 16143/16143 co-relation queries the response was YES.
[2024-06-14 14:54:54,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4722 conditions, 764 events. 424/764 cut-off events. For 16143/16143 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3613 event pairs, 69 based on Foata normal form. 1/765 useless extension candidates. Maximal degree in co-relation 4649. Up to 649 conditions per place.
[2024-06-14 14:54:54,216 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 129 selfloop transitions, 43 changer transitions 0/174 dead transitions.
[2024-06-14 14:54:54,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 174 transitions, 2237 flow
[2024-06-14 14:54:54,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:54:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:54:54,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions.
[2024-06-14 14:54:54,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096
[2024-06-14 14:54:54,218 INFO L175 Difference]: Start difference. First operand has 165 places, 158 transitions, 1807 flow. Second operand 10 states and 114 transitions.
[2024-06-14 14:54:54,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 174 transitions, 2237 flow
[2024-06-14 14:54:54,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 174 transitions, 2099 flow, removed 25 selfloop flow, removed 8 redundant places.
[2024-06-14 14:54:54,252 INFO L231 Difference]: Finished difference. Result has 167 places, 161 transitions, 1815 flow
[2024-06-14 14:54:54,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1675, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1815, PETRI_PLACES=167, PETRI_TRANSITIONS=161}
[2024-06-14 14:54:54,252 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 137 predicate places.
[2024-06-14 14:54:54,252 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 161 transitions, 1815 flow
[2024-06-14 14:54:54,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:54,252 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:54,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:54,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-14 14:54:54,253 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:54:54,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:54,253 INFO L85 PathProgramCache]: Analyzing trace with hash 437340775, now seen corresponding path program 1 times
[2024-06-14 14:54:54,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:54,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016558330]
[2024-06-14 14:54:54,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:54,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:54:58,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:58,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016558330]
[2024-06-14 14:54:58,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016558330] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:58,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:58,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:54:58,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15459844]
[2024-06-14 14:54:58,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:58,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:54:58,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:58,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:54:58,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:54:59,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:54:59,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 161 transitions, 1815 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:59,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:59,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:54:59,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:59,475 INFO L124 PetriNetUnfolderBase]: 420/758 cut-off events.
[2024-06-14 14:54:59,475 INFO L125 PetriNetUnfolderBase]: For 14647/14647 co-relation queries the response was YES.
[2024-06-14 14:54:59,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4608 conditions, 758 events. 420/758 cut-off events. For 14647/14647 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3545 event pairs, 135 based on Foata normal form. 2/760 useless extension candidates. Maximal degree in co-relation 4535. Up to 715 conditions per place.
[2024-06-14 14:54:59,481 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 157 selfloop transitions, 15 changer transitions 0/174 dead transitions.
[2024-06-14 14:54:59,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 174 transitions, 2199 flow
[2024-06-14 14:54:59,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:54:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:54:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions.
[2024-06-14 14:54:59,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194
[2024-06-14 14:54:59,482 INFO L175 Difference]: Start difference. First operand has 167 places, 161 transitions, 1815 flow. Second operand 9 states and 99 transitions.
[2024-06-14 14:54:59,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 174 transitions, 2199 flow
[2024-06-14 14:54:59,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 174 transitions, 2096 flow, removed 10 selfloop flow, removed 8 redundant places.
[2024-06-14 14:54:59,516 INFO L231 Difference]: Finished difference. Result has 168 places, 163 transitions, 1767 flow
[2024-06-14 14:54:59,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1712, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1767, PETRI_PLACES=168, PETRI_TRANSITIONS=163}
[2024-06-14 14:54:59,516 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 138 predicate places.
[2024-06-14 14:54:59,516 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 163 transitions, 1767 flow
[2024-06-14 14:54:59,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:59,517 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:59,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:59,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-14 14:54:59,517 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:54:59,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:59,517 INFO L85 PathProgramCache]: Analyzing trace with hash 28613139, now seen corresponding path program 13 times
[2024-06-14 14:54:59,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:59,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953280816]
[2024-06-14 14:54:59,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:59,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:04,917 INFO 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 14:55:04,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:04,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953280816]
[2024-06-14 14:55:04,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953280816] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:04,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:04,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:55:04,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164387703]
[2024-06-14 14:55:04,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:04,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:55:04,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:04,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:55:04,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:55:05,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:55:05,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 163 transitions, 1767 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:05,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:05,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:55:05,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:05,453 INFO L124 PetriNetUnfolderBase]: 423/763 cut-off events.
[2024-06-14 14:55:05,453 INFO L125 PetriNetUnfolderBase]: For 13916/13916 co-relation queries the response was YES.
[2024-06-14 14:55:05,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4582 conditions, 763 events. 423/763 cut-off events. For 13916/13916 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3589 event pairs, 135 based on Foata normal form. 1/764 useless extension candidates. Maximal degree in co-relation 4509. Up to 727 conditions per place.
[2024-06-14 14:55:05,459 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 158 selfloop transitions, 19 changer transitions 0/179 dead transitions.
[2024-06-14 14:55:05,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 179 transitions, 2215 flow
[2024-06-14 14:55:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:55:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:55:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions.
[2024-06-14 14:55:05,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677
[2024-06-14 14:55:05,460 INFO L175 Difference]: Start difference. First operand has 168 places, 163 transitions, 1767 flow. Second operand 10 states and 106 transitions.
[2024-06-14 14:55:05,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 179 transitions, 2215 flow
[2024-06-14 14:55:05,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 179 transitions, 2176 flow, removed 6 selfloop flow, removed 7 redundant places.
[2024-06-14 14:55:05,493 INFO L231 Difference]: Finished difference. Result has 173 places, 170 transitions, 1864 flow
[2024-06-14 14:55:05,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1728, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1864, PETRI_PLACES=173, PETRI_TRANSITIONS=170}
[2024-06-14 14:55:05,494 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 143 predicate places.
[2024-06-14 14:55:05,494 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 170 transitions, 1864 flow
[2024-06-14 14:55:05,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:05,494 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:05,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:55:05,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-14 14:55:05,494 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:55:05,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:05,495 INFO L85 PathProgramCache]: Analyzing trace with hash 256514289, now seen corresponding path program 14 times
[2024-06-14 14:55:05,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:05,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529044593]
[2024-06-14 14:55:05,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:05,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:10,610 INFO 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 14:55:10,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:10,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529044593]
[2024-06-14 14:55:10,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529044593] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:10,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:10,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:55:10,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997906110]
[2024-06-14 14:55:10,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:10,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:55:10,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:10,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:55:10,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:55:10,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:55:10,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 170 transitions, 1864 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:10,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:10,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:55:10,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:11,128 INFO L124 PetriNetUnfolderBase]: 421/760 cut-off events.
[2024-06-14 14:55:11,129 INFO L125 PetriNetUnfolderBase]: For 14212/14212 co-relation queries the response was YES.
[2024-06-14 14:55:11,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4577 conditions, 760 events. 421/760 cut-off events. For 14212/14212 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3587 event pairs, 131 based on Foata normal form. 1/761 useless extension candidates. Maximal degree in co-relation 4501. Up to 730 conditions per place.
[2024-06-14 14:55:11,134 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 162 selfloop transitions, 15 changer transitions 0/179 dead transitions.
[2024-06-14 14:55:11,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 179 transitions, 2246 flow
[2024-06-14 14:55:11,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:55:11,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:55:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions.
[2024-06-14 14:55:11,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637
[2024-06-14 14:55:11,136 INFO L175 Difference]: Start difference. First operand has 173 places, 170 transitions, 1864 flow. Second operand 9 states and 96 transitions.
[2024-06-14 14:55:11,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 179 transitions, 2246 flow
[2024-06-14 14:55:11,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 179 transitions, 2200 flow, removed 17 selfloop flow, removed 4 redundant places.
[2024-06-14 14:55:11,171 INFO L231 Difference]: Finished difference. Result has 179 places, 171 transitions, 1868 flow
[2024-06-14 14:55:11,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1868, PETRI_PLACES=179, PETRI_TRANSITIONS=171}
[2024-06-14 14:55:11,171 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 149 predicate places.
[2024-06-14 14:55:11,171 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 171 transitions, 1868 flow
[2024-06-14 14:55:11,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:11,172 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:11,172 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 14:55:11,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-14 14:55:11,172 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:55:11,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:11,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2123210819, now seen corresponding path program 1 times
[2024-06-14 14:55:11,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:11,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853661333]
[2024-06-14 14:55:11,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:11,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:18,204 INFO 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 14:55:18,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:18,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853661333]
[2024-06-14 14:55:18,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853661333] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:18,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:18,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:55:18,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916118193]
[2024-06-14 14:55:18,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:18,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:55:18,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:18,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:55:18,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:55:18,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31
[2024-06-14 14:55:18,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 171 transitions, 1868 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:18,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:18,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31
[2024-06-14 14:55:18,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:18,724 INFO L124 PetriNetUnfolderBase]: 432/781 cut-off events.
[2024-06-14 14:55:18,725 INFO L125 PetriNetUnfolderBase]: For 16412/16412 co-relation queries the response was YES.
[2024-06-14 14:55:18,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4749 conditions, 781 events. 432/781 cut-off events. For 16412/16412 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3733 event pairs, 72 based on Foata normal form. 2/783 useless extension candidates. Maximal degree in co-relation 4670. Up to 582 conditions per place.
[2024-06-14 14:55:18,730 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 146 selfloop transitions, 44 changer transitions 0/192 dead transitions.
[2024-06-14 14:55:18,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 192 transitions, 2382 flow
[2024-06-14 14:55:18,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 14:55:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 14:55:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions.
[2024-06-14 14:55:18,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3519061583577713
[2024-06-14 14:55:18,731 INFO L175 Difference]: Start difference. First operand has 179 places, 171 transitions, 1868 flow. Second operand 11 states and 120 transitions.
[2024-06-14 14:55:18,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 192 transitions, 2382 flow
[2024-06-14 14:55:18,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 192 transitions, 2311 flow, removed 16 selfloop flow, removed 7 redundant places.
[2024-06-14 14:55:18,767 INFO L231 Difference]: Finished difference. Result has 183 places, 173 transitions, 1911 flow
[2024-06-14 14:55:18,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1797, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1911, PETRI_PLACES=183, PETRI_TRANSITIONS=173}
[2024-06-14 14:55:18,767 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 153 predicate places.
[2024-06-14 14:55:18,767 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 173 transitions, 1911 flow
[2024-06-14 14:55:18,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:18,767 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:18,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 14:55:18,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-14 14:55:18,768 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:55:18,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:18,768 INFO L85 PathProgramCache]: Analyzing trace with hash -56264605, now seen corresponding path program 2 times
[2024-06-14 14:55:18,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:18,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502901755]
[2024-06-14 14:55:18,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:18,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:25,577 INFO 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 14:55:25,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:25,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502901755]
[2024-06-14 14:55:25,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502901755] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:25,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:25,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:55:25,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718258020]
[2024-06-14 14:55:25,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:25,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:55:25,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:25,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:55:25,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:55:25,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:55:25,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 173 transitions, 1911 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:25,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:25,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:55:25,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:26,056 INFO L124 PetriNetUnfolderBase]: 443/802 cut-off events.
[2024-06-14 14:55:26,056 INFO L125 PetriNetUnfolderBase]: For 18617/18617 co-relation queries the response was YES.
[2024-06-14 14:55:26,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4971 conditions, 802 events. 443/802 cut-off events. For 18617/18617 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3886 event pairs, 77 based on Foata normal form. 2/804 useless extension candidates. Maximal degree in co-relation 4892. Up to 658 conditions per place.
[2024-06-14 14:55:26,062 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 145 selfloop transitions, 45 changer transitions 0/192 dead transitions.
[2024-06-14 14:55:26,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 192 transitions, 2425 flow
[2024-06-14 14:55:26,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 14:55:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 14:55:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions.
[2024-06-14 14:55:26,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812316715542522
[2024-06-14 14:55:26,065 INFO L175 Difference]: Start difference. First operand has 183 places, 173 transitions, 1911 flow. Second operand 11 states and 130 transitions.
[2024-06-14 14:55:26,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 192 transitions, 2425 flow
[2024-06-14 14:55:26,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 192 transitions, 2344 flow, removed 13 selfloop flow, removed 7 redundant places.
[2024-06-14 14:55:26,104 INFO L231 Difference]: Finished difference. Result has 187 places, 175 transitions, 1950 flow
[2024-06-14 14:55:26,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1842, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1950, PETRI_PLACES=187, PETRI_TRANSITIONS=175}
[2024-06-14 14:55:26,105 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 157 predicate places.
[2024-06-14 14:55:26,105 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 175 transitions, 1950 flow
[2024-06-14 14:55:26,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:26,106 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:26,106 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 14:55:26,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-14 14:55:26,106 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:55:26,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:26,106 INFO L85 PathProgramCache]: Analyzing trace with hash -56260885, now seen corresponding path program 3 times
[2024-06-14 14:55:26,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:26,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658118614]
[2024-06-14 14:55:26,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:26,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:32,680 INFO 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 14:55:32,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:32,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658118614]
[2024-06-14 14:55:32,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658118614] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:32,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:32,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:55:32,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885794310]
[2024-06-14 14:55:32,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:32,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:55:32,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:32,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:55:32,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:55:32,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:55:32,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 175 transitions, 1950 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:32,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:32,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:55:32,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:33,131 INFO L124 PetriNetUnfolderBase]: 440/797 cut-off events.
[2024-06-14 14:55:33,131 INFO L125 PetriNetUnfolderBase]: For 18327/18327 co-relation queries the response was YES.
[2024-06-14 14:55:33,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4936 conditions, 797 events. 440/797 cut-off events. For 18327/18327 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3852 event pairs, 78 based on Foata normal form. 2/799 useless extension candidates. Maximal degree in co-relation 4855. Up to 670 conditions per place.
[2024-06-14 14:55:33,137 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 144 selfloop transitions, 44 changer transitions 0/190 dead transitions.
[2024-06-14 14:55:33,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 190 transitions, 2364 flow
[2024-06-14 14:55:33,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 14:55:33,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 14:55:33,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions.
[2024-06-14 14:55:33,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724340175953079
[2024-06-14 14:55:33,139 INFO L175 Difference]: Start difference. First operand has 187 places, 175 transitions, 1950 flow. Second operand 11 states and 127 transitions.
[2024-06-14 14:55:33,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 190 transitions, 2364 flow
[2024-06-14 14:55:33,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 190 transitions, 2303 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-14 14:55:33,177 INFO L231 Difference]: Finished difference. Result has 191 places, 175 transitions, 1981 flow
[2024-06-14 14:55:33,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1889, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1981, PETRI_PLACES=191, PETRI_TRANSITIONS=175}
[2024-06-14 14:55:33,178 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 161 predicate places.
[2024-06-14 14:55:33,178 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 175 transitions, 1981 flow
[2024-06-14 14:55:33,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:33,178 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:33,178 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 14:55:33,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-14 14:55:33,178 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:55:33,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:33,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2126277936, now seen corresponding path program 1 times
[2024-06-14 14:55:33,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:33,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755889089]
[2024-06-14 14:55:33,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:33,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:38,200 INFO 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 14:55:38,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:38,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755889089]
[2024-06-14 14:55:38,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755889089] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:38,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:38,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:55:38,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999830640]
[2024-06-14 14:55:38,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:38,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:55:38,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:38,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:55:38,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:55:38,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:55:38,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 175 transitions, 1981 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:38,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:38,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:55:38,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:38,711 INFO L124 PetriNetUnfolderBase]: 472/849 cut-off events.
[2024-06-14 14:55:38,712 INFO L125 PetriNetUnfolderBase]: For 22126/22126 co-relation queries the response was YES.
[2024-06-14 14:55:38,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5440 conditions, 849 events. 472/849 cut-off events. For 22126/22126 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4119 event pairs, 86 based on Foata normal form. 2/851 useless extension candidates. Maximal degree in co-relation 5357. Up to 560 conditions per place.
[2024-06-14 14:55:38,719 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 135 selfloop transitions, 64 changer transitions 0/201 dead transitions.
[2024-06-14 14:55:38,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 201 transitions, 2591 flow
[2024-06-14 14:55:38,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:55:38,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:55:38,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions.
[2024-06-14 14:55:38,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4129032258064516
[2024-06-14 14:55:38,721 INFO L175 Difference]: Start difference. First operand has 191 places, 175 transitions, 1981 flow. Second operand 10 states and 128 transitions.
[2024-06-14 14:55:38,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 201 transitions, 2591 flow
[2024-06-14 14:55:38,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 201 transitions, 2501 flow, removed 0 selfloop flow, removed 10 redundant places.
[2024-06-14 14:55:38,769 INFO L231 Difference]: Finished difference. Result has 192 places, 183 transitions, 2159 flow
[2024-06-14 14:55:38,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1891, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2159, PETRI_PLACES=192, PETRI_TRANSITIONS=183}
[2024-06-14 14:55:38,770 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 162 predicate places.
[2024-06-14 14:55:38,770 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 183 transitions, 2159 flow
[2024-06-14 14:55:38,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:38,771 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:38,771 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 14:55:38,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-14 14:55:38,771 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:55:38,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:38,771 INFO L85 PathProgramCache]: Analyzing trace with hash 881465298, now seen corresponding path program 2 times
[2024-06-14 14:55:38,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:38,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183503378]
[2024-06-14 14:55:38,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:38,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:44,428 INFO 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 14:55:44,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:44,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183503378]
[2024-06-14 14:55:44,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183503378] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:44,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:44,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:55:44,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001716585]
[2024-06-14 14:55:44,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:44,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:55:44,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:44,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:55:44,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:55:44,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:55:44,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 183 transitions, 2159 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:44,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:44,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:55:44,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:45,056 INFO L124 PetriNetUnfolderBase]: 468/843 cut-off events.
[2024-06-14 14:55:45,057 INFO L125 PetriNetUnfolderBase]: For 22413/22413 co-relation queries the response was YES.
[2024-06-14 14:55:45,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5535 conditions, 843 events. 468/843 cut-off events. For 22413/22413 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4104 event pairs, 77 based on Foata normal form. 2/845 useless extension candidates. Maximal degree in co-relation 5450. Up to 638 conditions per place.
[2024-06-14 14:55:45,062 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 147 selfloop transitions, 50 changer transitions 0/199 dead transitions.
[2024-06-14 14:55:45,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 199 transitions, 2591 flow
[2024-06-14 14:55:45,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:55:45,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:55:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions.
[2024-06-14 14:55:45,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258
[2024-06-14 14:55:45,063 INFO L175 Difference]: Start difference. First operand has 192 places, 183 transitions, 2159 flow. Second operand 10 states and 126 transitions.
[2024-06-14 14:55:45,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 199 transitions, 2591 flow
[2024-06-14 14:55:45,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 199 transitions, 2529 flow, removed 17 selfloop flow, removed 5 redundant places.
[2024-06-14 14:55:45,113 INFO L231 Difference]: Finished difference. Result has 197 places, 183 transitions, 2202 flow
[2024-06-14 14:55:45,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2097, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2202, PETRI_PLACES=197, PETRI_TRANSITIONS=183}
[2024-06-14 14:55:45,114 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 167 predicate places.
[2024-06-14 14:55:45,114 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 183 transitions, 2202 flow
[2024-06-14 14:55:45,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:45,114 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:45,114 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 14:55:45,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-14 14:55:45,114 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:55:45,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:45,115 INFO L85 PathProgramCache]: Analyzing trace with hash 493580898, now seen corresponding path program 3 times
[2024-06-14 14:55:45,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:45,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580339552]
[2024-06-14 14:55:45,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:45,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:50,557 INFO 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 14:55:50,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:50,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580339552]
[2024-06-14 14:55:50,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580339552] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:50,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:50,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:55:50,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129068998]
[2024-06-14 14:55:50,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:50,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:55:50,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:50,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:55:50,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:55:50,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:55:50,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 183 transitions, 2202 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:50,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:50,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:55:50,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:51,183 INFO L124 PetriNetUnfolderBase]: 474/853 cut-off events.
[2024-06-14 14:55:51,183 INFO L125 PetriNetUnfolderBase]: For 23713/23713 co-relation queries the response was YES.
[2024-06-14 14:55:51,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5712 conditions, 853 events. 474/853 cut-off events. For 23713/23713 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4140 event pairs, 73 based on Foata normal form. 2/855 useless extension candidates. Maximal degree in co-relation 5625. Up to 617 conditions per place.
[2024-06-14 14:55:51,189 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 144 selfloop transitions, 57 changer transitions 0/203 dead transitions.
[2024-06-14 14:55:51,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 203 transitions, 2680 flow
[2024-06-14 14:55:51,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:55:51,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:55:51,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions.
[2024-06-14 14:55:51,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744
[2024-06-14 14:55:51,193 INFO L175 Difference]: Start difference. First operand has 197 places, 183 transitions, 2202 flow. Second operand 10 states and 130 transitions.
[2024-06-14 14:55:51,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 203 transitions, 2680 flow
[2024-06-14 14:55:51,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 203 transitions, 2560 flow, removed 4 selfloop flow, removed 10 redundant places.
[2024-06-14 14:55:51,240 INFO L231 Difference]: Finished difference. Result has 197 places, 185 transitions, 2239 flow
[2024-06-14 14:55:51,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2239, PETRI_PLACES=197, PETRI_TRANSITIONS=185}
[2024-06-14 14:55:51,241 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 167 predicate places.
[2024-06-14 14:55:51,241 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 185 transitions, 2239 flow
[2024-06-14 14:55:51,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:51,241 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:51,241 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 14:55:51,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-14 14:55:51,242 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:55:51,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:51,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2081853555, now seen corresponding path program 4 times
[2024-06-14 14:55:51,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:51,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27793497]
[2024-06-14 14:55:51,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:51,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:57,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 14:55:57,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:57,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27793497]
[2024-06-14 14:55:57,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27793497] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:57,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:57,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:55:57,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081738035]
[2024-06-14 14:55:57,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:57,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:55:57,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:57,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:55:57,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:55:58,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:55:58,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 185 transitions, 2239 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:58,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:58,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:55:58,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:58,597 INFO L124 PetriNetUnfolderBase]: 494/897 cut-off events.
[2024-06-14 14:55:58,597 INFO L125 PetriNetUnfolderBase]: For 32528/32528 co-relation queries the response was YES.
[2024-06-14 14:55:58,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5903 conditions, 897 events. 494/897 cut-off events. For 32528/32528 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4436 event pairs, 80 based on Foata normal form. 12/909 useless extension candidates. Maximal degree in co-relation 5816. Up to 728 conditions per place.
[2024-06-14 14:55:58,603 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 162 selfloop transitions, 35 changer transitions 8/207 dead transitions.
[2024-06-14 14:55:58,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 207 transitions, 2735 flow
[2024-06-14 14:55:58,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 14:55:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 14:55:58,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions.
[2024-06-14 14:55:58,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39589442815249265
[2024-06-14 14:55:58,604 INFO L175 Difference]: Start difference. First operand has 197 places, 185 transitions, 2239 flow. Second operand 11 states and 135 transitions.
[2024-06-14 14:55:58,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 207 transitions, 2735 flow
[2024-06-14 14:55:58,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 207 transitions, 2584 flow, removed 20 selfloop flow, removed 8 redundant places.
[2024-06-14 14:55:58,658 INFO L231 Difference]: Finished difference. Result has 200 places, 183 transitions, 2144 flow
[2024-06-14 14:55:58,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2144, PETRI_PLACES=200, PETRI_TRANSITIONS=183}
[2024-06-14 14:55:58,659 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 170 predicate places.
[2024-06-14 14:55:58,659 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 183 transitions, 2144 flow
[2024-06-14 14:55:58,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:58,659 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:58,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:55:58,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-14 14:55:58,659 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:55:58,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:58,659 INFO L85 PathProgramCache]: Analyzing trace with hash -2082001425, now seen corresponding path program 5 times
[2024-06-14 14:55:58,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:58,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31293635]
[2024-06-14 14:55:58,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:58,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:05,069 INFO 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 14:56:05,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:05,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31293635]
[2024-06-14 14:56:05,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31293635] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:05,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:05,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:56:05,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830149138]
[2024-06-14 14:56:05,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:05,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:56:05,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:05,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:56:05,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:56:05,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:56:05,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 183 transitions, 2144 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:05,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:05,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:56:05,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:05,653 INFO L124 PetriNetUnfolderBase]: 479/868 cut-off events.
[2024-06-14 14:56:05,653 INFO L125 PetriNetUnfolderBase]: For 26966/26966 co-relation queries the response was YES.
[2024-06-14 14:56:05,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5748 conditions, 868 events. 479/868 cut-off events. For 26966/26966 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4306 event pairs, 84 based on Foata normal form. 2/870 useless extension candidates. Maximal degree in co-relation 5660. Up to 721 conditions per place.
[2024-06-14 14:56:05,661 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 152 selfloop transitions, 46 changer transitions 0/200 dead transitions.
[2024-06-14 14:56:05,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 200 transitions, 2676 flow
[2024-06-14 14:56:05,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:56:05,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:56:05,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions.
[2024-06-14 14:56:05,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742
[2024-06-14 14:56:05,663 INFO L175 Difference]: Start difference. First operand has 200 places, 183 transitions, 2144 flow. Second operand 10 states and 122 transitions.
[2024-06-14 14:56:05,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 200 transitions, 2676 flow
[2024-06-14 14:56:05,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 200 transitions, 2600 flow, removed 4 selfloop flow, removed 10 redundant places.
[2024-06-14 14:56:05,722 INFO L231 Difference]: Finished difference. Result has 199 places, 185 transitions, 2188 flow
[2024-06-14 14:56:05,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2070, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2188, PETRI_PLACES=199, PETRI_TRANSITIONS=185}
[2024-06-14 14:56:05,722 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 169 predicate places.
[2024-06-14 14:56:05,722 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 185 transitions, 2188 flow
[2024-06-14 14:56:05,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:05,723 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:05,723 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 14:56:05,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-14 14:56:05,723 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:56:05,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:05,723 INFO L85 PathProgramCache]: Analyzing trace with hash 493436593, now seen corresponding path program 6 times
[2024-06-14 14:56:05,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:05,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433150959]
[2024-06-14 14:56:05,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:05,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:11,263 INFO 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 14:56:11,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:11,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433150959]
[2024-06-14 14:56:11,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433150959] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:11,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:11,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:56:11,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702444123]
[2024-06-14 14:56:11,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:11,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:56:11,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:11,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:56:11,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:56:11,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:56:11,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 185 transitions, 2188 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:11,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:11,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:56:11,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:11,803 INFO L124 PetriNetUnfolderBase]: 476/863 cut-off events.
[2024-06-14 14:56:11,803 INFO L125 PetriNetUnfolderBase]: For 25418/25418 co-relation queries the response was YES.
[2024-06-14 14:56:11,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5674 conditions, 863 events. 476/863 cut-off events. For 25418/25418 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4248 event pairs, 87 based on Foata normal form. 2/865 useless extension candidates. Maximal degree in co-relation 5586. Up to 739 conditions per place.
[2024-06-14 14:56:11,810 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 152 selfloop transitions, 44 changer transitions 0/198 dead transitions.
[2024-06-14 14:56:11,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 198 transitions, 2612 flow
[2024-06-14 14:56:11,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:56:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:56:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions.
[2024-06-14 14:56:11,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484
[2024-06-14 14:56:11,811 INFO L175 Difference]: Start difference. First operand has 199 places, 185 transitions, 2188 flow. Second operand 10 states and 120 transitions.
[2024-06-14 14:56:11,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 198 transitions, 2612 flow
[2024-06-14 14:56:11,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 198 transitions, 2547 flow, removed 5 selfloop flow, removed 6 redundant places.
[2024-06-14 14:56:11,864 INFO L231 Difference]: Finished difference. Result has 203 places, 185 transitions, 2215 flow
[2024-06-14 14:56:11,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2123, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2215, PETRI_PLACES=203, PETRI_TRANSITIONS=185}
[2024-06-14 14:56:11,865 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 173 predicate places.
[2024-06-14 14:56:11,865 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 185 transitions, 2215 flow
[2024-06-14 14:56:11,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:11,865 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:11,865 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 14:56:11,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-14 14:56:11,865 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:56:11,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:11,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2081997550, now seen corresponding path program 4 times
[2024-06-14 14:56:11,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:11,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891796953]
[2024-06-14 14:56:11,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:11,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:17,155 INFO 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 14:56:17,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:17,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891796953]
[2024-06-14 14:56:17,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891796953] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:17,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:17,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:56:17,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078097401]
[2024-06-14 14:56:17,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:17,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:56:17,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:17,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:56:17,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:56:17,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:56:17,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 185 transitions, 2215 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:17,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:17,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:56:17,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:17,753 INFO L124 PetriNetUnfolderBase]: 482/873 cut-off events.
[2024-06-14 14:56:17,753 INFO L125 PetriNetUnfolderBase]: For 26864/26864 co-relation queries the response was YES.
[2024-06-14 14:56:17,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5831 conditions, 873 events. 482/873 cut-off events. For 26864/26864 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4341 event pairs, 79 based on Foata normal form. 2/875 useless extension candidates. Maximal degree in co-relation 5741. Up to 655 conditions per place.
[2024-06-14 14:56:17,760 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 148 selfloop transitions, 54 changer transitions 0/204 dead transitions.
[2024-06-14 14:56:17,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 204 transitions, 2695 flow
[2024-06-14 14:56:17,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:56:17,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:56:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions.
[2024-06-14 14:56:17,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645
[2024-06-14 14:56:17,761 INFO L175 Difference]: Start difference. First operand has 203 places, 185 transitions, 2215 flow. Second operand 10 states and 129 transitions.
[2024-06-14 14:56:17,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 204 transitions, 2695 flow
[2024-06-14 14:56:17,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 204 transitions, 2601 flow, removed 1 selfloop flow, removed 9 redundant places.
[2024-06-14 14:56:17,816 INFO L231 Difference]: Finished difference. Result has 204 places, 187 transitions, 2274 flow
[2024-06-14 14:56:17,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2121, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2274, PETRI_PLACES=204, PETRI_TRANSITIONS=187}
[2024-06-14 14:56:17,817 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 174 predicate places.
[2024-06-14 14:56:17,817 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 187 transitions, 2274 flow
[2024-06-14 14:56:17,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:17,817 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:17,817 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 14:56:17,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-14 14:56:17,817 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:56:17,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:17,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1566340949, now seen corresponding path program 7 times
[2024-06-14 14:56:17,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:17,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313362535]
[2024-06-14 14:56:17,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:17,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:56:24,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:24,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313362535]
[2024-06-14 14:56:24,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313362535] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:24,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:24,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:56:24,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251574122]
[2024-06-14 14:56:24,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:24,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:56:24,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:24,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:56:24,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:56:24,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:56:24,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 187 transitions, 2274 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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 14:56:24,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:24,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:56:24,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:25,482 INFO L124 PetriNetUnfolderBase]: 486/881 cut-off events.
[2024-06-14 14:56:25,482 INFO L125 PetriNetUnfolderBase]: For 28131/28131 co-relation queries the response was YES.
[2024-06-14 14:56:25,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5935 conditions, 881 events. 486/881 cut-off events. For 28131/28131 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4353 event pairs, 73 based on Foata normal form. 2/883 useless extension candidates. Maximal degree in co-relation 5844. Up to 448 conditions per place.
[2024-06-14 14:56:25,489 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 135 selfloop transitions, 67 changer transitions 0/204 dead transitions.
[2024-06-14 14:56:25,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 204 transitions, 2810 flow
[2024-06-14 14:56:25,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:56:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:56:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions.
[2024-06-14 14:56:25,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37992831541218636
[2024-06-14 14:56:25,491 INFO L175 Difference]: Start difference. First operand has 204 places, 187 transitions, 2274 flow. Second operand 9 states and 106 transitions.
[2024-06-14 14:56:25,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 204 transitions, 2810 flow
[2024-06-14 14:56:25,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 204 transitions, 2679 flow, removed 13 selfloop flow, removed 8 redundant places.
[2024-06-14 14:56:25,549 INFO L231 Difference]: Finished difference. Result has 205 places, 188 transitions, 2291 flow
[2024-06-14 14:56:25,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2143, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2291, PETRI_PLACES=205, PETRI_TRANSITIONS=188}
[2024-06-14 14:56:25,549 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 175 predicate places.
[2024-06-14 14:56:25,550 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 188 transitions, 2291 flow
[2024-06-14 14:56:25,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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 14:56:25,550 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:25,550 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 14:56:25,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-14 14:56:25,550 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:56:25,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:25,551 INFO L85 PathProgramCache]: Analyzing trace with hash -63096817, now seen corresponding path program 8 times
[2024-06-14 14:56:25,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:25,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735953939]
[2024-06-14 14:56:25,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:25,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:56:32,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:32,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735953939]
[2024-06-14 14:56:32,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735953939] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:32,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:32,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:56:32,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992078071]
[2024-06-14 14:56:32,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:32,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:56:32,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:32,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:56:32,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:56:32,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:56:32,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 188 transitions, 2291 flow. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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 14:56:32,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:32,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:56:32,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:33,228 INFO L124 PetriNetUnfolderBase]: 497/902 cut-off events.
[2024-06-14 14:56:33,229 INFO L125 PetriNetUnfolderBase]: For 31010/31010 co-relation queries the response was YES.
[2024-06-14 14:56:33,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6139 conditions, 902 events. 497/902 cut-off events. For 31010/31010 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4503 event pairs, 79 based on Foata normal form. 2/904 useless extension candidates. Maximal degree in co-relation 6047. Up to 612 conditions per place.
[2024-06-14 14:56:33,234 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 145 selfloop transitions, 60 changer transitions 0/207 dead transitions.
[2024-06-14 14:56:33,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 207 transitions, 2853 flow
[2024-06-14 14:56:33,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:56:33,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:56:33,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions.
[2024-06-14 14:56:33,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742
[2024-06-14 14:56:33,236 INFO L175 Difference]: Start difference. First operand has 205 places, 188 transitions, 2291 flow. Second operand 10 states and 122 transitions.
[2024-06-14 14:56:33,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 207 transitions, 2853 flow
[2024-06-14 14:56:33,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 207 transitions, 2732 flow, removed 10 selfloop flow, removed 6 redundant places.
[2024-06-14 14:56:33,301 INFO L231 Difference]: Finished difference. Result has 209 places, 190 transitions, 2322 flow
[2024-06-14 14:56:33,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2180, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2322, PETRI_PLACES=209, PETRI_TRANSITIONS=190}
[2024-06-14 14:56:33,302 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 179 predicate places.
[2024-06-14 14:56:33,302 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 190 transitions, 2322 flow
[2024-06-14 14:56:33,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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 14:56:33,302 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:33,302 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 14:56:33,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-14 14:56:33,302 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:56:33,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:33,303 INFO L85 PathProgramCache]: Analyzing trace with hash 311462543, now seen corresponding path program 9 times
[2024-06-14 14:56:33,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:33,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008354423]
[2024-06-14 14:56:33,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:33,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:40,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:56:40,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:40,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008354423]
[2024-06-14 14:56:40,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008354423] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:40,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:40,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:56:40,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117582319]
[2024-06-14 14:56:40,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:40,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:56:40,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:40,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:56:40,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:56:40,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:56:40,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 190 transitions, 2322 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:40,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:40,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:56:40,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:40,771 INFO L124 PetriNetUnfolderBase]: 501/910 cut-off events.
[2024-06-14 14:56:40,771 INFO L125 PetriNetUnfolderBase]: For 32031/32031 co-relation queries the response was YES.
[2024-06-14 14:56:40,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6203 conditions, 910 events. 501/910 cut-off events. For 32031/32031 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4577 event pairs, 85 based on Foata normal form. 2/912 useless extension candidates. Maximal degree in co-relation 6110. Up to 770 conditions per place.
[2024-06-14 14:56:40,779 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 166 selfloop transitions, 41 changer transitions 0/209 dead transitions.
[2024-06-14 14:56:40,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 209 transitions, 2877 flow
[2024-06-14 14:56:40,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 14:56:40,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 14:56:40,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions.
[2024-06-14 14:56:40,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724340175953079
[2024-06-14 14:56:40,781 INFO L175 Difference]: Start difference. First operand has 209 places, 190 transitions, 2322 flow. Second operand 11 states and 127 transitions.
[2024-06-14 14:56:40,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 209 transitions, 2877 flow
[2024-06-14 14:56:40,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 209 transitions, 2804 flow, removed 4 selfloop flow, removed 7 redundant places.
[2024-06-14 14:56:40,855 INFO L231 Difference]: Finished difference. Result has 213 places, 191 transitions, 2346 flow
[2024-06-14 14:56:40,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2251, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2346, PETRI_PLACES=213, PETRI_TRANSITIONS=191}
[2024-06-14 14:56:40,855 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 183 predicate places.
[2024-06-14 14:56:40,855 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 191 transitions, 2346 flow
[2024-06-14 14:56:40,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:40,855 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:40,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 14:56:40,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-14 14:56:40,856 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:56:40,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:40,856 INFO L85 PathProgramCache]: Analyzing trace with hash 311913748, now seen corresponding path program 5 times
[2024-06-14 14:56:40,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:40,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214175755]
[2024-06-14 14:56:40,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:40,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:56:46,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:46,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214175755]
[2024-06-14 14:56:46,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214175755] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:46,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:46,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:56:46,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872156500]
[2024-06-14 14:56:46,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:46,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:56:46,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:46,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:56:46,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:56:46,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:56:46,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 191 transitions, 2346 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:46,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:46,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:56:46,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:46,515 INFO L124 PetriNetUnfolderBase]: 507/920 cut-off events.
[2024-06-14 14:56:46,515 INFO L125 PetriNetUnfolderBase]: For 32247/32247 co-relation queries the response was YES.
[2024-06-14 14:56:46,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6329 conditions, 920 events. 507/920 cut-off events. For 32247/32247 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4650 event pairs, 84 based on Foata normal form. 2/922 useless extension candidates. Maximal degree in co-relation 6235. Up to 717 conditions per place.
[2024-06-14 14:56:46,522 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 132 selfloop transitions, 74 changer transitions 0/208 dead transitions.
[2024-06-14 14:56:46,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 208 transitions, 2828 flow
[2024-06-14 14:56:46,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:56:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:56:46,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions.
[2024-06-14 14:56:46,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484
[2024-06-14 14:56:46,523 INFO L175 Difference]: Start difference. First operand has 213 places, 191 transitions, 2346 flow. Second operand 10 states and 120 transitions.
[2024-06-14 14:56:46,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 208 transitions, 2828 flow
[2024-06-14 14:56:46,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 208 transitions, 2723 flow, removed 3 selfloop flow, removed 9 redundant places.
[2024-06-14 14:56:46,597 INFO L231 Difference]: Finished difference. Result has 214 places, 193 transitions, 2430 flow
[2024-06-14 14:56:46,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2241, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2430, PETRI_PLACES=214, PETRI_TRANSITIONS=193}
[2024-06-14 14:56:46,598 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 184 predicate places.
[2024-06-14 14:56:46,598 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 193 transitions, 2430 flow
[2024-06-14 14:56:46,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:46,598 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:46,598 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 14:56:46,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-14 14:56:46,598 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:56:46,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:46,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1883584623, now seen corresponding path program 10 times
[2024-06-14 14:56:46,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:46,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201964396]
[2024-06-14 14:56:46,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:46,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:53,266 INFO 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 14:56:53,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:53,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201964396]
[2024-06-14 14:56:53,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201964396] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:53,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:53,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:56:53,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121475932]
[2024-06-14 14:56:53,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:53,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:56:53,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:53,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:56:53,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:56:53,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:56:53,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 193 transitions, 2430 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:53,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:53,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:56:53,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:53,808 INFO L124 PetriNetUnfolderBase]: 504/915 cut-off events.
[2024-06-14 14:56:53,808 INFO L125 PetriNetUnfolderBase]: For 31632/31632 co-relation queries the response was YES.
[2024-06-14 14:56:53,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6304 conditions, 915 events. 504/915 cut-off events. For 31632/31632 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4628 event pairs, 85 based on Foata normal form. 2/917 useless extension candidates. Maximal degree in co-relation 6209. Up to 792 conditions per place.
[2024-06-14 14:56:53,817 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 167 selfloop transitions, 39 changer transitions 0/208 dead transitions.
[2024-06-14 14:56:53,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 208 transitions, 2880 flow
[2024-06-14 14:56:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:56:53,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:56:53,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions.
[2024-06-14 14:56:53,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968
[2024-06-14 14:56:53,819 INFO L175 Difference]: Start difference. First operand has 214 places, 193 transitions, 2430 flow. Second operand 10 states and 116 transitions.
[2024-06-14 14:56:53,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 208 transitions, 2880 flow
[2024-06-14 14:56:53,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 208 transitions, 2750 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-14 14:56:53,889 INFO L231 Difference]: Finished difference. Result has 217 places, 193 transitions, 2382 flow
[2024-06-14 14:56:53,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2382, PETRI_PLACES=217, PETRI_TRANSITIONS=193}
[2024-06-14 14:56:53,890 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 187 predicate places.
[2024-06-14 14:56:53,890 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 193 transitions, 2382 flow
[2024-06-14 14:56:53,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:53,890 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:53,890 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 14:56:53,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-14 14:56:53,891 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:56:53,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:53,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1013209533, now seen corresponding path program 11 times
[2024-06-14 14:56:53,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:53,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066810658]
[2024-06-14 14:56:53,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:53,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:00,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 14:57:00,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:00,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066810658]
[2024-06-14 14:57:00,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066810658] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:00,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:00,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:57:00,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391260630]
[2024-06-14 14:57:00,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:00,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:57:00,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:00,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:57:00,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:57:00,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:57:00,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 193 transitions, 2382 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:00,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:00,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:57:00,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:01,430 INFO L124 PetriNetUnfolderBase]: 513/933 cut-off events.
[2024-06-14 14:57:01,430 INFO L125 PetriNetUnfolderBase]: For 32745/32745 co-relation queries the response was YES.
[2024-06-14 14:57:01,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6333 conditions, 933 events. 513/933 cut-off events. For 32745/32745 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4752 event pairs, 91 based on Foata normal form. 2/935 useless extension candidates. Maximal degree in co-relation 6237. Up to 798 conditions per place.
[2024-06-14 14:57:01,439 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 173 selfloop transitions, 40 changer transitions 0/215 dead transitions.
[2024-06-14 14:57:01,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 215 transitions, 2976 flow
[2024-06-14 14:57:01,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-06-14 14:57:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-14 14:57:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 142 transitions.
[2024-06-14 14:57:01,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3817204301075269
[2024-06-14 14:57:01,441 INFO L175 Difference]: Start difference. First operand has 217 places, 193 transitions, 2382 flow. Second operand 12 states and 142 transitions.
[2024-06-14 14:57:01,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 215 transitions, 2976 flow
[2024-06-14 14:57:01,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 215 transitions, 2896 flow, removed 0 selfloop flow, removed 9 redundant places.
[2024-06-14 14:57:01,525 INFO L231 Difference]: Finished difference. Result has 221 places, 195 transitions, 2419 flow
[2024-06-14 14:57:01,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2302, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2419, PETRI_PLACES=221, PETRI_TRANSITIONS=195}
[2024-06-14 14:57:01,526 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 191 predicate places.
[2024-06-14 14:57:01,526 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 195 transitions, 2419 flow
[2024-06-14 14:57:01,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:01,526 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:01,526 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 14:57:01,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-14 14:57:01,526 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:57:01,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:01,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1169332853, now seen corresponding path program 12 times
[2024-06-14 14:57:01,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:01,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193577472]
[2024-06-14 14:57:01,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:01,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:08,586 INFO 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 14:57:08,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:08,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193577472]
[2024-06-14 14:57:08,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193577472] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:08,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:08,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:57:08,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570782749]
[2024-06-14 14:57:08,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:08,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:57:08,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:08,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:57:08,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:57:08,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:57:08,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 195 transitions, 2419 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:08,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:08,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:57:08,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:09,333 INFO L124 PetriNetUnfolderBase]: 517/941 cut-off events.
[2024-06-14 14:57:09,334 INFO L125 PetriNetUnfolderBase]: For 34166/34166 co-relation queries the response was YES.
[2024-06-14 14:57:09,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6438 conditions, 941 events. 517/941 cut-off events. For 34166/34166 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4798 event pairs, 88 based on Foata normal form. 2/943 useless extension candidates. Maximal degree in co-relation 6340. Up to 790 conditions per place.
[2024-06-14 14:57:09,343 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 170 selfloop transitions, 45 changer transitions 0/217 dead transitions.
[2024-06-14 14:57:09,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 217 transitions, 3012 flow
[2024-06-14 14:57:09,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-06-14 14:57:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-14 14:57:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions.
[2024-06-14 14:57:09,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3897849462365591
[2024-06-14 14:57:09,344 INFO L175 Difference]: Start difference. First operand has 221 places, 195 transitions, 2419 flow. Second operand 12 states and 145 transitions.
[2024-06-14 14:57:09,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 217 transitions, 3012 flow
[2024-06-14 14:57:09,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 217 transitions, 2848 flow, removed 8 selfloop flow, removed 12 redundant places.
[2024-06-14 14:57:09,430 INFO L231 Difference]: Finished difference. Result has 221 places, 196 transitions, 2368 flow
[2024-06-14 14:57:09,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2261, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2368, PETRI_PLACES=221, PETRI_TRANSITIONS=196}
[2024-06-14 14:57:09,431 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 191 predicate places.
[2024-06-14 14:57:09,431 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 196 transitions, 2368 flow
[2024-06-14 14:57:09,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:09,431 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:09,431 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 14:57:09,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-14 14:57:09,431 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:57:09,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:09,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1169333008, now seen corresponding path program 6 times
[2024-06-14 14:57:09,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:09,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991256087]
[2024-06-14 14:57:09,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:09,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:14,880 INFO 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 14:57:14,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:14,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991256087]
[2024-06-14 14:57:14,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991256087] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:14,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:14,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:57:14,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251275542]
[2024-06-14 14:57:14,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:14,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:57:14,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:14,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:57:14,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:57:15,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:57:15,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 196 transitions, 2368 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:15,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:15,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:57:15,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:15,581 INFO L124 PetriNetUnfolderBase]: 523/951 cut-off events.
[2024-06-14 14:57:15,582 INFO L125 PetriNetUnfolderBase]: For 35658/35658 co-relation queries the response was YES.
[2024-06-14 14:57:15,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6377 conditions, 951 events. 523/951 cut-off events. For 35658/35658 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4874 event pairs, 91 based on Foata normal form. 2/953 useless extension candidates. Maximal degree in co-relation 6280. Up to 702 conditions per place.
[2024-06-14 14:57:15,593 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 157 selfloop transitions, 59 changer transitions 0/218 dead transitions.
[2024-06-14 14:57:15,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 218 transitions, 2986 flow
[2024-06-14 14:57:15,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:57:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:57:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions.
[2024-06-14 14:57:15,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4290322580645161
[2024-06-14 14:57:15,600 INFO L175 Difference]: Start difference. First operand has 221 places, 196 transitions, 2368 flow. Second operand 10 states and 133 transitions.
[2024-06-14 14:57:15,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 218 transitions, 2986 flow
[2024-06-14 14:57:15,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 218 transitions, 2910 flow, removed 2 selfloop flow, removed 9 redundant places.
[2024-06-14 14:57:15,682 INFO L231 Difference]: Finished difference. Result has 222 places, 198 transitions, 2455 flow
[2024-06-14 14:57:15,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2292, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2455, PETRI_PLACES=222, PETRI_TRANSITIONS=198}
[2024-06-14 14:57:15,683 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 192 predicate places.
[2024-06-14 14:57:15,683 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 198 transitions, 2455 flow
[2024-06-14 14:57:15,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:15,683 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:15,684 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 14:57:15,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-14 14:57:15,684 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:57:15,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:15,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1169477003, now seen corresponding path program 13 times
[2024-06-14 14:57:15,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:15,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169960588]
[2024-06-14 14:57:15,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:15,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:23,314 INFO 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 14:57:23,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:23,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169960588]
[2024-06-14 14:57:23,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169960588] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:23,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:23,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:57:23,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615764988]
[2024-06-14 14:57:23,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:23,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:57:23,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:23,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:57:23,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:57:23,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:57:23,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 198 transitions, 2455 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:23,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:23,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:57:23,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:23,935 INFO L124 PetriNetUnfolderBase]: 527/959 cut-off events.
[2024-06-14 14:57:23,935 INFO L125 PetriNetUnfolderBase]: For 37197/37197 co-relation queries the response was YES.
[2024-06-14 14:57:23,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6502 conditions, 959 events. 527/959 cut-off events. For 37197/37197 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4915 event pairs, 93 based on Foata normal form. 2/961 useless extension candidates. Maximal degree in co-relation 6404. Up to 869 conditions per place.
[2024-06-14 14:57:23,945 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 182 selfloop transitions, 31 changer transitions 0/215 dead transitions.
[2024-06-14 14:57:23,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 215 transitions, 2934 flow
[2024-06-14 14:57:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-06-14 14:57:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-14 14:57:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 135 transitions.
[2024-06-14 14:57:23,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516
[2024-06-14 14:57:23,947 INFO L175 Difference]: Start difference. First operand has 222 places, 198 transitions, 2455 flow. Second operand 12 states and 135 transitions.
[2024-06-14 14:57:23,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 215 transitions, 2934 flow
[2024-06-14 14:57:24,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 215 transitions, 2771 flow, removed 17 selfloop flow, removed 8 redundant places.
[2024-06-14 14:57:24,032 INFO L231 Difference]: Finished difference. Result has 226 places, 199 transitions, 2373 flow
[2024-06-14 14:57:24,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2292, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2373, PETRI_PLACES=226, PETRI_TRANSITIONS=199}
[2024-06-14 14:57:24,033 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 196 predicate places.
[2024-06-14 14:57:24,033 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 199 transitions, 2373 flow
[2024-06-14 14:57:24,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:24,033 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:24,033 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 14:57:24,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-14 14:57:24,033 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:57:24,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:24,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1007483802, now seen corresponding path program 1 times
[2024-06-14 14:57:24,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:24,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934098820]
[2024-06-14 14:57:24,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:24,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:30,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:57:30,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:30,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934098820]
[2024-06-14 14:57:30,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934098820] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:30,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:30,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:57:30,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297057636]
[2024-06-14 14:57:30,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:30,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:57:30,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:30,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:57:30,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:57:30,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:57:30,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 199 transitions, 2373 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:30,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:30,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:57:30,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:31,198 INFO L124 PetriNetUnfolderBase]: 535/975 cut-off events.
[2024-06-14 14:57:31,198 INFO L125 PetriNetUnfolderBase]: For 40881/40881 co-relation queries the response was YES.
[2024-06-14 14:57:31,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6458 conditions, 975 events. 535/975 cut-off events. For 40881/40881 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5027 event pairs, 93 based on Foata normal form. 4/979 useless extension candidates. Maximal degree in co-relation 6359. Up to 767 conditions per place.
[2024-06-14 14:57:31,206 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 166 selfloop transitions, 49 changer transitions 0/217 dead transitions.
[2024-06-14 14:57:31,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 217 transitions, 2861 flow
[2024-06-14 14:57:31,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:57:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:57:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions.
[2024-06-14 14:57:31,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129
[2024-06-14 14:57:31,208 INFO L175 Difference]: Start difference. First operand has 226 places, 199 transitions, 2373 flow. Second operand 10 states and 125 transitions.
[2024-06-14 14:57:31,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 217 transitions, 2861 flow
[2024-06-14 14:57:31,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 217 transitions, 2795 flow, removed 3 selfloop flow, removed 10 redundant places.
[2024-06-14 14:57:31,292 INFO L231 Difference]: Finished difference. Result has 226 places, 201 transitions, 2434 flow
[2024-06-14 14:57:31,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2307, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2434, PETRI_PLACES=226, PETRI_TRANSITIONS=201}
[2024-06-14 14:57:31,292 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 196 predicate places.
[2024-06-14 14:57:31,293 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 201 transitions, 2434 flow
[2024-06-14 14:57:31,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:31,293 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:31,293 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 14:57:31,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-14 14:57:31,293 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:57:31,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash -577348138, now seen corresponding path program 7 times
[2024-06-14 14:57:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:31,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619793707]
[2024-06-14 14:57:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:31,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:36,874 INFO 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 14:57:36,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:36,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619793707]
[2024-06-14 14:57:36,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619793707] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:36,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:36,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 14:57:36,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003202693]
[2024-06-14 14:57:36,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:36,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 14:57:36,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:36,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 14:57:36,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 14:57:37,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:57:37,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 201 transitions, 2434 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:37,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:37,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:57:37,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:37,663 INFO L124 PetriNetUnfolderBase]: 547/996 cut-off events.
[2024-06-14 14:57:37,663 INFO L125 PetriNetUnfolderBase]: For 40034/40034 co-relation queries the response was YES.
[2024-06-14 14:57:37,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6673 conditions, 996 events. 547/996 cut-off events. For 40034/40034 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5161 event pairs, 90 based on Foata normal form. 2/998 useless extension candidates. Maximal degree in co-relation 6573. Up to 787 conditions per place.
[2024-06-14 14:57:37,673 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 172 selfloop transitions, 52 changer transitions 0/226 dead transitions.
[2024-06-14 14:57:37,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 226 transitions, 2984 flow
[2024-06-14 14:57:37,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-06-14 14:57:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2024-06-14 14:57:37,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 154 transitions.
[2024-06-14 14:57:37,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38213399503722084
[2024-06-14 14:57:37,681 INFO L175 Difference]: Start difference. First operand has 226 places, 201 transitions, 2434 flow. Second operand 13 states and 154 transitions.
[2024-06-14 14:57:37,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 226 transitions, 2984 flow
[2024-06-14 14:57:37,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 226 transitions, 2869 flow, removed 8 selfloop flow, removed 8 redundant places.
[2024-06-14 14:57:37,772 INFO L231 Difference]: Finished difference. Result has 231 places, 205 transitions, 2486 flow
[2024-06-14 14:57:37,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2323, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2486, PETRI_PLACES=231, PETRI_TRANSITIONS=205}
[2024-06-14 14:57:37,773 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 201 predicate places.
[2024-06-14 14:57:37,773 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 205 transitions, 2486 flow
[2024-06-14 14:57:37,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:37,773 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:37,773 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 14:57:37,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-14 14:57:37,773 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:57:37,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:37,773 INFO L85 PathProgramCache]: Analyzing trace with hash -763710838, now seen corresponding path program 8 times
[2024-06-14 14:57:37,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:37,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119552778]
[2024-06-14 14:57:37,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:37,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:43,279 INFO 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 14:57:43,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:43,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119552778]
[2024-06-14 14:57:43,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119552778] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:43,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:43,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:57:43,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60931378]
[2024-06-14 14:57:43,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:43,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:57:43,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:43,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:57:43,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:57:43,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:57:43,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 205 transitions, 2486 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:43,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:43,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:57:43,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:43,956 INFO L124 PetriNetUnfolderBase]: 553/1005 cut-off events.
[2024-06-14 14:57:43,956 INFO L125 PetriNetUnfolderBase]: For 41595/41595 co-relation queries the response was YES.
[2024-06-14 14:57:43,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6758 conditions, 1005 events. 553/1005 cut-off events. For 41595/41595 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5225 event pairs, 92 based on Foata normal form. 2/1007 useless extension candidates. Maximal degree in co-relation 6657. Up to 788 conditions per place.
[2024-06-14 14:57:43,965 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 171 selfloop transitions, 53 changer transitions 0/226 dead transitions.
[2024-06-14 14:57:43,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 226 transitions, 3016 flow
[2024-06-14 14:57:43,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:57:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:57:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions.
[2024-06-14 14:57:43,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42258064516129035
[2024-06-14 14:57:43,966 INFO L175 Difference]: Start difference. First operand has 231 places, 205 transitions, 2486 flow. Second operand 10 states and 131 transitions.
[2024-06-14 14:57:43,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 226 transitions, 3016 flow
[2024-06-14 14:57:44,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 226 transitions, 2898 flow, removed 8 selfloop flow, removed 10 redundant places.
[2024-06-14 14:57:44,060 INFO L231 Difference]: Finished difference. Result has 231 places, 207 transitions, 2519 flow
[2024-06-14 14:57:44,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2368, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2519, PETRI_PLACES=231, PETRI_TRANSITIONS=207}
[2024-06-14 14:57:44,060 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 201 predicate places.
[2024-06-14 14:57:44,061 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 207 transitions, 2519 flow
[2024-06-14 14:57:44,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:44,061 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:44,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:57:44,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-14 14:57:44,061 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:57:44,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:44,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1174845118, now seen corresponding path program 9 times
[2024-06-14 14:57:44,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:44,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794782651]
[2024-06-14 14:57:44,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:44,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:49,533 INFO 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 14:57:49,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:49,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794782651]
[2024-06-14 14:57:49,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794782651] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:49,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:49,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 14:57:49,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040470337]
[2024-06-14 14:57:49,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:49,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 14:57:49,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:49,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 14:57:49,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 14:57:49,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:57:49,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 207 transitions, 2519 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:49,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:49,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:57:49,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:50,269 INFO L124 PetriNetUnfolderBase]: 549/1000 cut-off events.
[2024-06-14 14:57:50,269 INFO L125 PetriNetUnfolderBase]: For 40201/40201 co-relation queries the response was YES.
[2024-06-14 14:57:50,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6638 conditions, 1000 events. 549/1000 cut-off events. For 40201/40201 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5197 event pairs, 89 based on Foata normal form. 2/1002 useless extension candidates. Maximal degree in co-relation 6536. Up to 791 conditions per place.
[2024-06-14 14:57:50,279 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 173 selfloop transitions, 51 changer transitions 0/226 dead transitions.
[2024-06-14 14:57:50,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 226 transitions, 3011 flow
[2024-06-14 14:57:50,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 14:57:50,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 14:57:50,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions.
[2024-06-14 14:57:50,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046920821114369
[2024-06-14 14:57:50,281 INFO L175 Difference]: Start difference. First operand has 231 places, 207 transitions, 2519 flow. Second operand 11 states and 138 transitions.
[2024-06-14 14:57:50,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 226 transitions, 3011 flow
[2024-06-14 14:57:50,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 226 transitions, 2880 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-14 14:57:50,375 INFO L231 Difference]: Finished difference. Result has 235 places, 207 transitions, 2495 flow
[2024-06-14 14:57:50,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2388, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2495, PETRI_PLACES=235, PETRI_TRANSITIONS=207}
[2024-06-14 14:57:50,376 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 205 predicate places.
[2024-06-14 14:57:50,376 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 207 transitions, 2495 flow
[2024-06-14 14:57:50,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:50,376 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:50,376 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 14:57:50,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-14 14:57:50,377 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:57:50,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:50,377 INFO L85 PathProgramCache]: Analyzing trace with hash -493553904, now seen corresponding path program 10 times
[2024-06-14 14:57:50,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:50,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128989742]
[2024-06-14 14:57:50,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:50,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:56,190 INFO 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 14:57:56,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:56,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128989742]
[2024-06-14 14:57:56,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128989742] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:56,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:56,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 14:57:56,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292074631]
[2024-06-14 14:57:56,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:56,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 14:57:56,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:56,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 14:57:56,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 14:57:56,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:57:56,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 207 transitions, 2495 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:56,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:56,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:57:56,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:56,966 INFO L124 PetriNetUnfolderBase]: 545/994 cut-off events.
[2024-06-14 14:57:56,966 INFO L125 PetriNetUnfolderBase]: For 38473/38473 co-relation queries the response was YES.
[2024-06-14 14:57:56,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6471 conditions, 994 events. 545/994 cut-off events. For 38473/38473 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5179 event pairs, 88 based on Foata normal form. 2/996 useless extension candidates. Maximal degree in co-relation 6368. Up to 768 conditions per place.
[2024-06-14 14:57:56,975 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 168 selfloop transitions, 56 changer transitions 0/226 dead transitions.
[2024-06-14 14:57:56,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 226 transitions, 2987 flow
[2024-06-14 14:57:56,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 14:57:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 14:57:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions.
[2024-06-14 14:57:56,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40762463343108507
[2024-06-14 14:57:56,977 INFO L175 Difference]: Start difference. First operand has 235 places, 207 transitions, 2495 flow. Second operand 11 states and 139 transitions.
[2024-06-14 14:57:56,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 226 transitions, 2987 flow
[2024-06-14 14:57:57,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 226 transitions, 2843 flow, removed 13 selfloop flow, removed 10 redundant places.
[2024-06-14 14:57:57,065 INFO L231 Difference]: Finished difference. Result has 236 places, 207 transitions, 2468 flow
[2024-06-14 14:57:57,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2351, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2468, PETRI_PLACES=236, PETRI_TRANSITIONS=207}
[2024-06-14 14:57:57,066 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 206 predicate places.
[2024-06-14 14:57:57,066 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 207 transitions, 2468 flow
[2024-06-14 14:57:57,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:57,066 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:57,066 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 14:57:57,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-14 14:57:57,066 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:57:57,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:57,066 INFO L85 PathProgramCache]: Analyzing trace with hash -493554059, now seen corresponding path program 14 times
[2024-06-14 14:57:57,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:57,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239887157]
[2024-06-14 14:57:57,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:57,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:04,270 INFO 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 14:58:04,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:04,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239887157]
[2024-06-14 14:58:04,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239887157] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:04,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:04,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 14:58:04,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446180056]
[2024-06-14 14:58:04,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:04,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 14:58:04,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:04,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 14:58:04,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 14:58:04,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:58:04,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 207 transitions, 2468 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:04,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:04,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:58:04,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:04,882 INFO L124 PetriNetUnfolderBase]: 542/989 cut-off events.
[2024-06-14 14:58:04,883 INFO L125 PetriNetUnfolderBase]: For 36474/36474 co-relation queries the response was YES.
[2024-06-14 14:58:04,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6323 conditions, 989 events. 542/989 cut-off events. For 36474/36474 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5147 event pairs, 95 based on Foata normal form. 2/991 useless extension candidates. Maximal degree in co-relation 6219. Up to 898 conditions per place.
[2024-06-14 14:58:04,892 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 188 selfloop transitions, 32 changer transitions 0/222 dead transitions.
[2024-06-14 14:58:04,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 222 transitions, 2944 flow
[2024-06-14 14:58:04,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-06-14 14:58:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-14 14:58:04,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions.
[2024-06-14 14:58:04,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3602150537634409
[2024-06-14 14:58:04,893 INFO L175 Difference]: Start difference. First operand has 236 places, 207 transitions, 2468 flow. Second operand 12 states and 134 transitions.
[2024-06-14 14:58:04,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 222 transitions, 2944 flow
[2024-06-14 14:58:04,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 222 transitions, 2798 flow, removed 8 selfloop flow, removed 10 redundant places.
[2024-06-14 14:58:04,978 INFO L231 Difference]: Finished difference. Result has 238 places, 207 transitions, 2390 flow
[2024-06-14 14:58:04,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2322, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2390, PETRI_PLACES=238, PETRI_TRANSITIONS=207}
[2024-06-14 14:58:04,978 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 208 predicate places.
[2024-06-14 14:58:04,979 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 207 transitions, 2390 flow
[2024-06-14 14:58:04,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:04,979 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:04,979 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 14:58:04,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-14 14:58:04,979 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:58:04,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:04,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1868421353, now seen corresponding path program 15 times
[2024-06-14 14:58:04,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:04,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101108466]
[2024-06-14 14:58:04,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:04,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:10,510 INFO 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 14:58:10,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:10,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101108466]
[2024-06-14 14:58:10,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101108466] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:10,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:10,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:58:10,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878605835]
[2024-06-14 14:58:10,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:10,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:58:10,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:10,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:58:10,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:58:10,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:58:10,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 207 transitions, 2390 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:10,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:10,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:58:10,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:11,052 INFO L124 PetriNetUnfolderBase]: 546/997 cut-off events.
[2024-06-14 14:58:11,053 INFO L125 PetriNetUnfolderBase]: For 37413/37413 co-relation queries the response was YES.
[2024-06-14 14:58:11,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6255 conditions, 997 events. 546/997 cut-off events. For 37413/37413 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5214 event pairs, 53 based on Foata normal form. 2/999 useless extension candidates. Maximal degree in co-relation 6150. Up to 528 conditions per place.
[2024-06-14 14:58:11,061 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 128 selfloop transitions, 95 changer transitions 0/225 dead transitions.
[2024-06-14 14:58:11,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 225 transitions, 2995 flow
[2024-06-14 14:58:11,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:58:11,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:58:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions.
[2024-06-14 14:58:11,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774193548387097
[2024-06-14 14:58:11,062 INFO L175 Difference]: Start difference. First operand has 238 places, 207 transitions, 2390 flow. Second operand 10 states and 117 transitions.
[2024-06-14 14:58:11,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 225 transitions, 2995 flow
[2024-06-14 14:58:11,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 225 transitions, 2929 flow, removed 2 selfloop flow, removed 10 redundant places.
[2024-06-14 14:58:11,155 INFO L231 Difference]: Finished difference. Result has 238 places, 208 transitions, 2531 flow
[2024-06-14 14:58:11,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2324, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2531, PETRI_PLACES=238, PETRI_TRANSITIONS=208}
[2024-06-14 14:58:11,155 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 208 predicate places.
[2024-06-14 14:58:11,155 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 208 transitions, 2531 flow
[2024-06-14 14:58:11,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:11,155 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:11,155 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 14:58:11,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-14 14:58:11,156 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:58:11,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:11,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1866543528, now seen corresponding path program 11 times
[2024-06-14 14:58:11,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:11,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803991036]
[2024-06-14 14:58:11,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:11,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:16,466 INFO 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 14:58:16,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:16,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803991036]
[2024-06-14 14:58:16,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803991036] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:16,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:16,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:58:16,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422841978]
[2024-06-14 14:58:16,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:16,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:58:16,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:16,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:58:16,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:58:16,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:58:16,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 208 transitions, 2531 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:16,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:16,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:58:16,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:16,934 INFO L124 PetriNetUnfolderBase]: 562/1023 cut-off events.
[2024-06-14 14:58:16,934 INFO L125 PetriNetUnfolderBase]: For 42329/42329 co-relation queries the response was YES.
[2024-06-14 14:58:16,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6754 conditions, 1023 events. 562/1023 cut-off events. For 42329/42329 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5322 event pairs, 85 based on Foata normal form. 2/1025 useless extension candidates. Maximal degree in co-relation 6648. Up to 612 conditions per place.
[2024-06-14 14:58:16,944 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 124 selfloop transitions, 102 changer transitions 0/228 dead transitions.
[2024-06-14 14:58:16,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 228 transitions, 3207 flow
[2024-06-14 14:58:16,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:58:16,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:58:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions.
[2024-06-14 14:58:16,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121863799283154
[2024-06-14 14:58:16,948 INFO L175 Difference]: Start difference. First operand has 238 places, 208 transitions, 2531 flow. Second operand 9 states and 115 transitions.
[2024-06-14 14:58:16,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 228 transitions, 3207 flow
[2024-06-14 14:58:17,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 228 transitions, 3050 flow, removed 5 selfloop flow, removed 9 redundant places.
[2024-06-14 14:58:17,039 INFO L231 Difference]: Finished difference. Result has 238 places, 212 transitions, 2669 flow
[2024-06-14 14:58:17,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2378, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2669, PETRI_PLACES=238, PETRI_TRANSITIONS=212}
[2024-06-14 14:58:17,039 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 208 predicate places.
[2024-06-14 14:58:17,039 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 212 transitions, 2669 flow
[2024-06-14 14:58:17,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:17,039 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:17,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:58:17,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2024-06-14 14:58:17,040 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:58:17,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:17,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1866543683, now seen corresponding path program 16 times
[2024-06-14 14:58:17,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:17,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166298435]
[2024-06-14 14:58:17,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:17,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:22,533 INFO 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 14:58:22,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:22,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166298435]
[2024-06-14 14:58:22,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166298435] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:22,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:22,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:58:22,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741977865]
[2024-06-14 14:58:22,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:22,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:58:22,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:22,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:58:22,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:58:22,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:58:22,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 212 transitions, 2669 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:22,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:22,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:58:22,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:23,061 INFO L124 PetriNetUnfolderBase]: 566/1031 cut-off events.
[2024-06-14 14:58:23,061 INFO L125 PetriNetUnfolderBase]: For 41296/41296 co-relation queries the response was YES.
[2024-06-14 14:58:23,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6862 conditions, 1031 events. 566/1031 cut-off events. For 41296/41296 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5409 event pairs, 90 based on Foata normal form. 2/1033 useless extension candidates. Maximal degree in co-relation 6757. Up to 816 conditions per place.
[2024-06-14 14:58:23,070 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 145 selfloop transitions, 80 changer transitions 0/227 dead transitions.
[2024-06-14 14:58:23,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 227 transitions, 3161 flow
[2024-06-14 14:58:23,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:58:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:58:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions.
[2024-06-14 14:58:23,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774193548387097
[2024-06-14 14:58:23,071 INFO L175 Difference]: Start difference. First operand has 238 places, 212 transitions, 2669 flow. Second operand 10 states and 117 transitions.
[2024-06-14 14:58:23,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 227 transitions, 3161 flow
[2024-06-14 14:58:23,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 227 transitions, 3052 flow, removed 21 selfloop flow, removed 6 redundant places.
[2024-06-14 14:58:23,162 INFO L231 Difference]: Finished difference. Result has 242 places, 213 transitions, 2738 flow
[2024-06-14 14:58:23,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2560, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2738, PETRI_PLACES=242, PETRI_TRANSITIONS=213}
[2024-06-14 14:58:23,163 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 212 predicate places.
[2024-06-14 14:58:23,163 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 213 transitions, 2738 flow
[2024-06-14 14:58:23,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:23,163 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:23,163 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 14:58:23,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2024-06-14 14:58:23,164 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:58:23,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:23,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1866547403, now seen corresponding path program 17 times
[2024-06-14 14:58:23,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:23,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972622647]
[2024-06-14 14:58:23,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:23,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:28,576 INFO 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 14:58:28,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:28,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972622647]
[2024-06-14 14:58:28,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972622647] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:28,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:28,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:58:28,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426075549]
[2024-06-14 14:58:28,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:28,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:58:28,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:28,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:58:28,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:58:28,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:58:28,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 213 transitions, 2738 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:28,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:28,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:58:28,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:29,186 INFO L124 PetriNetUnfolderBase]: 570/1039 cut-off events.
[2024-06-14 14:58:29,186 INFO L125 PetriNetUnfolderBase]: For 40783/40783 co-relation queries the response was YES.
[2024-06-14 14:58:29,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6948 conditions, 1039 events. 570/1039 cut-off events. For 40783/40783 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5457 event pairs, 84 based on Foata normal form. 2/1041 useless extension candidates. Maximal degree in co-relation 6842. Up to 782 conditions per place.
[2024-06-14 14:58:29,196 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 144 selfloop transitions, 83 changer transitions 0/229 dead transitions.
[2024-06-14 14:58:29,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 229 transitions, 3238 flow
[2024-06-14 14:58:29,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:58:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:58:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions.
[2024-06-14 14:58:29,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546
[2024-06-14 14:58:29,197 INFO L175 Difference]: Start difference. First operand has 242 places, 213 transitions, 2738 flow. Second operand 10 states and 119 transitions.
[2024-06-14 14:58:29,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 229 transitions, 3238 flow
[2024-06-14 14:58:29,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 229 transitions, 3074 flow, removed 3 selfloop flow, removed 10 redundant places.
[2024-06-14 14:58:29,289 INFO L231 Difference]: Finished difference. Result has 242 places, 214 transitions, 2760 flow
[2024-06-14 14:58:29,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2574, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2760, PETRI_PLACES=242, PETRI_TRANSITIONS=214}
[2024-06-14 14:58:29,290 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 212 predicate places.
[2024-06-14 14:58:29,290 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 214 transitions, 2760 flow
[2024-06-14 14:58:29,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:29,290 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:29,290 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 14:58:29,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77
[2024-06-14 14:58:29,290 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:58:29,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:29,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1102680282, now seen corresponding path program 12 times
[2024-06-14 14:58:29,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:29,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793878716]
[2024-06-14 14:58:29,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:29,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:34,671 INFO 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 14:58:34,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:34,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793878716]
[2024-06-14 14:58:34,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793878716] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:34,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:34,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:58:34,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878273310]
[2024-06-14 14:58:34,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:34,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:58:34,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:34,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:58:34,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:58:34,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:58:34,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 214 transitions, 2760 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:34,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:34,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:58:34,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:35,208 INFO L124 PetriNetUnfolderBase]: 576/1049 cut-off events.
[2024-06-14 14:58:35,208 INFO L125 PetriNetUnfolderBase]: For 40108/40108 co-relation queries the response was YES.
[2024-06-14 14:58:35,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7027 conditions, 1049 events. 576/1049 cut-off events. For 40108/40108 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5541 event pairs, 95 based on Foata normal form. 2/1051 useless extension candidates. Maximal degree in co-relation 6922. Up to 840 conditions per place.
[2024-06-14 14:58:35,218 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 170 selfloop transitions, 57 changer transitions 0/229 dead transitions.
[2024-06-14 14:58:35,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 229 transitions, 3282 flow
[2024-06-14 14:58:35,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:58:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:58:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions.
[2024-06-14 14:58:35,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914
[2024-06-14 14:58:35,219 INFO L175 Difference]: Start difference. First operand has 242 places, 214 transitions, 2760 flow. Second operand 9 states and 111 transitions.
[2024-06-14 14:58:35,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 229 transitions, 3282 flow
[2024-06-14 14:58:35,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 229 transitions, 3110 flow, removed 4 selfloop flow, removed 10 redundant places.
[2024-06-14 14:58:35,320 INFO L231 Difference]: Finished difference. Result has 241 places, 216 transitions, 2749 flow
[2024-06-14 14:58:35,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2588, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2749, PETRI_PLACES=241, PETRI_TRANSITIONS=216}
[2024-06-14 14:58:35,321 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 211 predicate places.
[2024-06-14 14:58:35,321 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 216 transitions, 2749 flow
[2024-06-14 14:58:35,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:35,321 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:35,321 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 14:58:35,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78
[2024-06-14 14:58:35,321 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:58:35,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:35,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1779707568, now seen corresponding path program 13 times
[2024-06-14 14:58:35,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:35,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545950652]
[2024-06-14 14:58:35,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:35,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:40,392 INFO 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 14:58:40,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:40,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545950652]
[2024-06-14 14:58:40,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545950652] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:40,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:40,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:58:40,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499857930]
[2024-06-14 14:58:40,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:40,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:58:40,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:40,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:58:40,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:58:40,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:58:40,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 216 transitions, 2749 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:40,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:40,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:58:40,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:40,972 INFO L124 PetriNetUnfolderBase]: 582/1059 cut-off events.
[2024-06-14 14:58:40,972 INFO L125 PetriNetUnfolderBase]: For 38886/38886 co-relation queries the response was YES.
[2024-06-14 14:58:40,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7045 conditions, 1059 events. 582/1059 cut-off events. For 38886/38886 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5568 event pairs, 91 based on Foata normal form. 2/1061 useless extension candidates. Maximal degree in co-relation 6941. Up to 810 conditions per place.
[2024-06-14 14:58:40,980 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 164 selfloop transitions, 67 changer transitions 0/233 dead transitions.
[2024-06-14 14:58:40,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 233 transitions, 3287 flow
[2024-06-14 14:58:40,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:58:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:58:40,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions.
[2024-06-14 14:58:40,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121863799283154
[2024-06-14 14:58:40,982 INFO L175 Difference]: Start difference. First operand has 241 places, 216 transitions, 2749 flow. Second operand 9 states and 115 transitions.
[2024-06-14 14:58:40,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 233 transitions, 3287 flow
[2024-06-14 14:58:41,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 233 transitions, 3130 flow, removed 17 selfloop flow, removed 8 redundant places.
[2024-06-14 14:58:41,087 INFO L231 Difference]: Finished difference. Result has 242 places, 218 transitions, 2780 flow
[2024-06-14 14:58:41,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2592, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2780, PETRI_PLACES=242, PETRI_TRANSITIONS=218}
[2024-06-14 14:58:41,088 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 212 predicate places.
[2024-06-14 14:58:41,088 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 218 transitions, 2780 flow
[2024-06-14 14:58:41,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:41,088 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:41,088 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 14:58:41,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79
[2024-06-14 14:58:41,088 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:58:41,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:41,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1779707723, now seen corresponding path program 18 times
[2024-06-14 14:58:41,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:41,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901218150]
[2024-06-14 14:58:41,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:41,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:46,726 INFO 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 14:58:46,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:46,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901218150]
[2024-06-14 14:58:46,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901218150] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:46,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:46,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:58:46,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487637865]
[2024-06-14 14:58:46,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:46,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:58:46,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:46,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:58:46,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:58:46,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:58:46,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 218 transitions, 2780 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:46,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:46,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:58:46,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:47,256 INFO L124 PetriNetUnfolderBase]: 586/1067 cut-off events.
[2024-06-14 14:58:47,256 INFO L125 PetriNetUnfolderBase]: For 40242/40242 co-relation queries the response was YES.
[2024-06-14 14:58:47,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7078 conditions, 1067 events. 586/1067 cut-off events. For 40242/40242 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5642 event pairs, 104 based on Foata normal form. 2/1069 useless extension candidates. Maximal degree in co-relation 6974. Up to 940 conditions per place.
[2024-06-14 14:58:47,266 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 180 selfloop transitions, 49 changer transitions 0/231 dead transitions.
[2024-06-14 14:58:47,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 231 transitions, 3278 flow
[2024-06-14 14:58:47,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:58:47,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:58:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions.
[2024-06-14 14:58:47,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096
[2024-06-14 14:58:47,267 INFO L175 Difference]: Start difference. First operand has 242 places, 218 transitions, 2780 flow. Second operand 10 states and 114 transitions.
[2024-06-14 14:58:47,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 231 transitions, 3278 flow
[2024-06-14 14:58:47,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 231 transitions, 3115 flow, removed 16 selfloop flow, removed 8 redundant places.
[2024-06-14 14:58:47,361 INFO L231 Difference]: Finished difference. Result has 244 places, 219 transitions, 2735 flow
[2024-06-14 14:58:47,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2617, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2735, PETRI_PLACES=244, PETRI_TRANSITIONS=219}
[2024-06-14 14:58:47,361 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places.
[2024-06-14 14:58:47,361 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 219 transitions, 2735 flow
[2024-06-14 14:58:47,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:47,362 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:47,362 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 14:58:47,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80
[2024-06-14 14:58:47,362 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:58:47,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:47,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1779851718, now seen corresponding path program 14 times
[2024-06-14 14:58:47,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:47,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103014756]
[2024-06-14 14:58:47,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:47,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:52,781 INFO 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 14:58:52,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:52,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103014756]
[2024-06-14 14:58:52,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103014756] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:52,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:52,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:58:52,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713232648]
[2024-06-14 14:58:52,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:52,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:58:52,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:52,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:58:52,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:58:52,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:58:52,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 219 transitions, 2735 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:52,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:52,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:58:52,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:53,243 INFO L124 PetriNetUnfolderBase]: 592/1077 cut-off events.
[2024-06-14 14:58:53,243 INFO L125 PetriNetUnfolderBase]: For 40126/40126 co-relation queries the response was YES.
[2024-06-14 14:58:53,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7066 conditions, 1077 events. 592/1077 cut-off events. For 40126/40126 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 5699 event pairs, 89 based on Foata normal form. 2/1079 useless extension candidates. Maximal degree in co-relation 6962. Up to 804 conditions per place.
[2024-06-14 14:58:53,253 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 159 selfloop transitions, 75 changer transitions 0/236 dead transitions.
[2024-06-14 14:58:53,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 236 transitions, 3283 flow
[2024-06-14 14:58:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:58:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:58:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions.
[2024-06-14 14:58:53,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4157706093189964
[2024-06-14 14:58:53,256 INFO L175 Difference]: Start difference. First operand has 244 places, 219 transitions, 2735 flow. Second operand 9 states and 116 transitions.
[2024-06-14 14:58:53,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 236 transitions, 3283 flow
[2024-06-14 14:58:53,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 236 transitions, 3179 flow, removed 4 selfloop flow, removed 9 redundant places.
[2024-06-14 14:58:53,355 INFO L231 Difference]: Finished difference. Result has 244 places, 221 transitions, 2839 flow
[2024-06-14 14:58:53,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2631, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2839, PETRI_PLACES=244, PETRI_TRANSITIONS=221}
[2024-06-14 14:58:53,356 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places.
[2024-06-14 14:58:53,356 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 221 transitions, 2839 flow
[2024-06-14 14:58:53,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:53,356 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:53,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:58:53,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81
[2024-06-14 14:58:53,356 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:58:53,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:53,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1779851873, now seen corresponding path program 19 times
[2024-06-14 14:58:53,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:53,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997324152]
[2024-06-14 14:58:53,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:53,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:58:58,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:58,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997324152]
[2024-06-14 14:58:58,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997324152] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:58,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:58,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:58:58,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054012684]
[2024-06-14 14:58:58,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:58,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:58:58,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:58,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:58:58,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:58:58,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:58:58,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 221 transitions, 2839 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:58,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:58,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:58:58,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:59,284 INFO L124 PetriNetUnfolderBase]: 596/1085 cut-off events.
[2024-06-14 14:58:59,284 INFO L125 PetriNetUnfolderBase]: For 40475/40475 co-relation queries the response was YES.
[2024-06-14 14:58:59,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7189 conditions, 1085 events. 596/1085 cut-off events. For 40475/40475 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 5748 event pairs, 106 based on Foata normal form. 2/1087 useless extension candidates. Maximal degree in co-relation 7085. Up to 946 conditions per place.
[2024-06-14 14:58:59,293 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 177 selfloop transitions, 55 changer transitions 0/234 dead transitions.
[2024-06-14 14:58:59,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 234 transitions, 3345 flow
[2024-06-14 14:58:59,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:58:59,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:58:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions.
[2024-06-14 14:58:59,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839
[2024-06-14 14:58:59,294 INFO L175 Difference]: Start difference. First operand has 244 places, 221 transitions, 2839 flow. Second operand 10 states and 115 transitions.
[2024-06-14 14:58:59,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 234 transitions, 3345 flow
[2024-06-14 14:58:59,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 234 transitions, 3162 flow, removed 18 selfloop flow, removed 8 redundant places.
[2024-06-14 14:58:59,396 INFO L231 Difference]: Finished difference. Result has 246 places, 222 transitions, 2788 flow
[2024-06-14 14:58:59,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2656, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2788, PETRI_PLACES=246, PETRI_TRANSITIONS=222}
[2024-06-14 14:58:59,397 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 216 predicate places.
[2024-06-14 14:58:59,397 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 222 transitions, 2788 flow
[2024-06-14 14:58:59,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:59,397 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:59,397 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 14:58:59,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82
[2024-06-14 14:58:59,397 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:58:59,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:59,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1779855593, now seen corresponding path program 20 times
[2024-06-14 14:58:59,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:59,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23879012]
[2024-06-14 14:58:59,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:59,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:04,903 INFO 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 14:59:04,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:04,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23879012]
[2024-06-14 14:59:04,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23879012] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:04,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:04,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:59:04,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834522639]
[2024-06-14 14:59:04,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:04,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:59:04,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:04,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:59:04,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:59:05,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:59:05,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 222 transitions, 2788 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:05,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:05,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:59:05,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:05,411 INFO L124 PetriNetUnfolderBase]: 600/1093 cut-off events.
[2024-06-14 14:59:05,412 INFO L125 PetriNetUnfolderBase]: For 40023/40023 co-relation queries the response was YES.
[2024-06-14 14:59:05,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7119 conditions, 1093 events. 600/1093 cut-off events. For 40023/40023 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 5826 event pairs, 104 based on Foata normal form. 2/1095 useless extension candidates. Maximal degree in co-relation 7015. Up to 914 conditions per place.
[2024-06-14 14:59:05,422 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 175 selfloop transitions, 59 changer transitions 0/236 dead transitions.
[2024-06-14 14:59:05,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 236 transitions, 3302 flow
[2024-06-14 14:59:05,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:59:05,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:59:05,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions.
[2024-06-14 14:59:05,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968
[2024-06-14 14:59:05,423 INFO L175 Difference]: Start difference. First operand has 246 places, 222 transitions, 2788 flow. Second operand 10 states and 116 transitions.
[2024-06-14 14:59:05,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 236 transitions, 3302 flow
[2024-06-14 14:59:05,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 236 transitions, 3184 flow, removed 5 selfloop flow, removed 9 redundant places.
[2024-06-14 14:59:05,523 INFO L231 Difference]: Finished difference. Result has 247 places, 223 transitions, 2812 flow
[2024-06-14 14:59:05,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2670, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2812, PETRI_PLACES=247, PETRI_TRANSITIONS=223}
[2024-06-14 14:59:05,524 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 217 predicate places.
[2024-06-14 14:59:05,524 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 223 transitions, 2812 flow
[2024-06-14 14:59:05,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:05,524 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:05,524 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 14:59:05,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83
[2024-06-14 14:59:05,525 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:59:05,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:05,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1794170677, now seen corresponding path program 21 times
[2024-06-14 14:59:05,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:05,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110403598]
[2024-06-14 14:59:05,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:05,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:10,825 INFO 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 14:59:10,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:10,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110403598]
[2024-06-14 14:59:10,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110403598] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:10,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:10,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:59:10,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837431068]
[2024-06-14 14:59:10,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:10,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:59:10,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:10,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:59:10,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:59:10,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:59:10,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 223 transitions, 2812 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:10,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:10,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:59:10,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:11,414 INFO L124 PetriNetUnfolderBase]: 604/1100 cut-off events.
[2024-06-14 14:59:11,414 INFO L125 PetriNetUnfolderBase]: For 40079/40079 co-relation queries the response was YES.
[2024-06-14 14:59:11,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7180 conditions, 1100 events. 604/1100 cut-off events. For 40079/40079 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 5883 event pairs, 62 based on Foata normal form. 2/1102 useless extension candidates. Maximal degree in co-relation 7076. Up to 826 conditions per place.
[2024-06-14 14:59:11,424 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 161 selfloop transitions, 80 changer transitions 0/243 dead transitions.
[2024-06-14 14:59:11,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 243 transitions, 3478 flow
[2024-06-14 14:59:11,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:59:11,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:59:11,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions.
[2024-06-14 14:59:11,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-14 14:59:11,427 INFO L175 Difference]: Start difference. First operand has 247 places, 223 transitions, 2812 flow. Second operand 10 states and 124 transitions.
[2024-06-14 14:59:11,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 243 transitions, 3478 flow
[2024-06-14 14:59:11,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 243 transitions, 3348 flow, removed 7 selfloop flow, removed 9 redundant places.
[2024-06-14 14:59:11,526 INFO L231 Difference]: Finished difference. Result has 248 places, 224 transitions, 2868 flow
[2024-06-14 14:59:11,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2684, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2868, PETRI_PLACES=248, PETRI_TRANSITIONS=224}
[2024-06-14 14:59:11,526 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places.
[2024-06-14 14:59:11,526 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 224 transitions, 2868 flow
[2024-06-14 14:59:11,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:11,527 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:11,527 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 14:59:11,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84
[2024-06-14 14:59:11,527 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:59:11,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:11,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1794174552, now seen corresponding path program 15 times
[2024-06-14 14:59:11,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:11,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167531723]
[2024-06-14 14:59:11,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:11,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:59:16,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:16,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167531723]
[2024-06-14 14:59:16,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167531723] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:16,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:16,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:59:16,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168115537]
[2024-06-14 14:59:16,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:16,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:59:16,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:16,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:59:16,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:59:16,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:59:16,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 224 transitions, 2868 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:16,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:16,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:59:16,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:17,176 INFO L124 PetriNetUnfolderBase]: 613/1115 cut-off events.
[2024-06-14 14:59:17,176 INFO L125 PetriNetUnfolderBase]: For 40477/40477 co-relation queries the response was YES.
[2024-06-14 14:59:17,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7364 conditions, 1115 events. 613/1115 cut-off events. For 40477/40477 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 5947 event pairs, 79 based on Foata normal form. 2/1117 useless extension candidates. Maximal degree in co-relation 7260. Up to 741 conditions per place.
[2024-06-14 14:59:17,187 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 145 selfloop transitions, 104 changer transitions 0/251 dead transitions.
[2024-06-14 14:59:17,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 251 transitions, 3640 flow
[2024-06-14 14:59:17,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:59:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:59:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions.
[2024-06-14 14:59:17,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-14 14:59:17,188 INFO L175 Difference]: Start difference. First operand has 248 places, 224 transitions, 2868 flow. Second operand 9 states and 124 transitions.
[2024-06-14 14:59:17,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 251 transitions, 3640 flow
[2024-06-14 14:59:17,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 251 transitions, 3452 flow, removed 8 selfloop flow, removed 8 redundant places.
[2024-06-14 14:59:17,292 INFO L231 Difference]: Finished difference. Result has 251 places, 230 transitions, 3067 flow
[2024-06-14 14:59:17,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2686, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3067, PETRI_PLACES=251, PETRI_TRANSITIONS=230}
[2024-06-14 14:59:17,292 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 221 predicate places.
[2024-06-14 14:59:17,293 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 230 transitions, 3067 flow
[2024-06-14 14:59:17,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:17,293 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:17,293 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 14:59:17,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85
[2024-06-14 14:59:17,293 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:59:17,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:17,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1823771193, now seen corresponding path program 22 times
[2024-06-14 14:59:17,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:17,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343926717]
[2024-06-14 14:59:17,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:17,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:23,009 INFO 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 14:59:23,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:23,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343926717]
[2024-06-14 14:59:23,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343926717] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:23,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:23,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:59:23,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145825001]
[2024-06-14 14:59:23,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:23,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:59:23,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:23,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:59:23,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:59:23,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:59:23,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 230 transitions, 3067 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:23,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:23,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:59:23,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:23,578 INFO L124 PetriNetUnfolderBase]: 617/1123 cut-off events.
[2024-06-14 14:59:23,578 INFO L125 PetriNetUnfolderBase]: For 40974/40974 co-relation queries the response was YES.
[2024-06-14 14:59:23,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7596 conditions, 1123 events. 617/1123 cut-off events. For 40974/40974 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6028 event pairs, 98 based on Foata normal form. 2/1125 useless extension candidates. Maximal degree in co-relation 7490. Up to 952 conditions per place.
[2024-06-14 14:59:23,588 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 173 selfloop transitions, 73 changer transitions 0/248 dead transitions.
[2024-06-14 14:59:23,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 248 transitions, 3629 flow
[2024-06-14 14:59:23,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:59:23,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:59:23,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions.
[2024-06-14 14:59:23,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742
[2024-06-14 14:59:23,590 INFO L175 Difference]: Start difference. First operand has 251 places, 230 transitions, 3067 flow. Second operand 10 states and 122 transitions.
[2024-06-14 14:59:23,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 248 transitions, 3629 flow
[2024-06-14 14:59:23,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 248 transitions, 3437 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-14 14:59:23,696 INFO L231 Difference]: Finished difference. Result has 255 places, 231 transitions, 3047 flow
[2024-06-14 14:59:23,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2875, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3047, PETRI_PLACES=255, PETRI_TRANSITIONS=231}
[2024-06-14 14:59:23,696 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 225 predicate places.
[2024-06-14 14:59:23,696 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 231 transitions, 3047 flow
[2024-06-14 14:59:23,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:23,696 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:23,696 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 14:59:23,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86
[2024-06-14 14:59:23,696 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:59:23,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:23,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1823626888, now seen corresponding path program 16 times
[2024-06-14 14:59:23,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:23,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695949543]
[2024-06-14 14:59:23,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:23,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:28,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 14:59:28,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:28,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695949543]
[2024-06-14 14:59:28,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695949543] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:28,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:28,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:59:28,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131332147]
[2024-06-14 14:59:28,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:28,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:59:28,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:28,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:59:28,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:59:28,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:59:28,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 231 transitions, 3047 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:28,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:28,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:59:28,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:29,255 INFO L124 PetriNetUnfolderBase]: 623/1135 cut-off events.
[2024-06-14 14:59:29,255 INFO L125 PetriNetUnfolderBase]: For 40840/40840 co-relation queries the response was YES.
[2024-06-14 14:59:29,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7574 conditions, 1135 events. 623/1135 cut-off events. For 40840/40840 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6109 event pairs, 99 based on Foata normal form. 2/1137 useless extension candidates. Maximal degree in co-relation 7468. Up to 877 conditions per place.
[2024-06-14 14:59:29,265 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 175 selfloop transitions, 75 changer transitions 0/252 dead transitions.
[2024-06-14 14:59:29,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 252 transitions, 3651 flow
[2024-06-14 14:59:29,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:59:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:59:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions.
[2024-06-14 14:59:29,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044
[2024-06-14 14:59:29,266 INFO L175 Difference]: Start difference. First operand has 255 places, 231 transitions, 3047 flow. Second operand 9 states and 120 transitions.
[2024-06-14 14:59:29,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 252 transitions, 3651 flow
[2024-06-14 14:59:29,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 252 transitions, 3475 flow, removed 9 selfloop flow, removed 11 redundant places.
[2024-06-14 14:59:29,373 INFO L231 Difference]: Finished difference. Result has 253 places, 233 transitions, 3083 flow
[2024-06-14 14:59:29,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2871, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3083, PETRI_PLACES=253, PETRI_TRANSITIONS=233}
[2024-06-14 14:59:29,374 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 223 predicate places.
[2024-06-14 14:59:29,374 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 233 transitions, 3083 flow
[2024-06-14 14:59:29,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:29,374 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:29,374 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 14:59:29,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87
[2024-06-14 14:59:29,374 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:59:29,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:29,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1823627043, now seen corresponding path program 23 times
[2024-06-14 14:59:29,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:29,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639612039]
[2024-06-14 14:59:29,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:29,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:34,988 INFO 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 14:59:34,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:34,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639612039]
[2024-06-14 14:59:34,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639612039] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:34,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:34,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:59:34,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134945956]
[2024-06-14 14:59:34,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:34,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:59:34,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:34,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:59:34,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:59:35,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:59:35,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 233 transitions, 3083 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:35,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:35,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:59:35,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:35,521 INFO L124 PetriNetUnfolderBase]: 627/1143 cut-off events.
[2024-06-14 14:59:35,522 INFO L125 PetriNetUnfolderBase]: For 41099/41099 co-relation queries the response was YES.
[2024-06-14 14:59:35,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7627 conditions, 1143 events. 627/1143 cut-off events. For 41099/41099 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6160 event pairs, 116 based on Foata normal form. 2/1145 useless extension candidates. Maximal degree in co-relation 7523. Up to 1015 conditions per place.
[2024-06-14 14:59:35,532 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 195 selfloop transitions, 52 changer transitions 0/249 dead transitions.
[2024-06-14 14:59:35,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 249 transitions, 3643 flow
[2024-06-14 14:59:35,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:59:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:59:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions.
[2024-06-14 14:59:35,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774193548387097
[2024-06-14 14:59:35,533 INFO L175 Difference]: Start difference. First operand has 253 places, 233 transitions, 3083 flow. Second operand 10 states and 117 transitions.
[2024-06-14 14:59:35,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 249 transitions, 3643 flow
[2024-06-14 14:59:35,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 249 transitions, 3454 flow, removed 18 selfloop flow, removed 8 redundant places.
[2024-06-14 14:59:35,636 INFO L231 Difference]: Finished difference. Result has 255 places, 234 transitions, 3026 flow
[2024-06-14 14:59:35,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2894, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3026, PETRI_PLACES=255, PETRI_TRANSITIONS=234}
[2024-06-14 14:59:35,637 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 225 predicate places.
[2024-06-14 14:59:35,637 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 234 transitions, 3026 flow
[2024-06-14 14:59:35,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:35,637 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:35,637 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 14:59:35,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88
[2024-06-14 14:59:35,637 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:59:35,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:35,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1799896408, now seen corresponding path program 2 times
[2024-06-14 14:59:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:35,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710793454]
[2024-06-14 14:59:35,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:35,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:40,834 INFO 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 14:59:40,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:40,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710793454]
[2024-06-14 14:59:40,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710793454] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:40,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:40,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 14:59:40,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115197161]
[2024-06-14 14:59:40,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:40,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 14:59:40,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:40,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 14:59:40,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-14 14:59:40,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:59:40,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 234 transitions, 3026 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:40,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:40,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:59:40,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:41,369 INFO L124 PetriNetUnfolderBase]: 635/1158 cut-off events.
[2024-06-14 14:59:41,369 INFO L125 PetriNetUnfolderBase]: For 44299/44299 co-relation queries the response was YES.
[2024-06-14 14:59:41,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7574 conditions, 1158 events. 635/1158 cut-off events. For 44299/44299 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 6287 event pairs, 101 based on Foata normal form. 4/1162 useless extension candidates. Maximal degree in co-relation 7470. Up to 933 conditions per place.
[2024-06-14 14:59:41,379 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 188 selfloop transitions, 59 changer transitions 0/249 dead transitions.
[2024-06-14 14:59:41,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 249 transitions, 3574 flow
[2024-06-14 14:59:41,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 14:59:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:59:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions.
[2024-06-14 14:59:41,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914
[2024-06-14 14:59:41,380 INFO L175 Difference]: Start difference. First operand has 255 places, 234 transitions, 3026 flow. Second operand 9 states and 111 transitions.
[2024-06-14 14:59:41,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 249 transitions, 3574 flow
[2024-06-14 14:59:41,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 249 transitions, 3364 flow, removed 10 selfloop flow, removed 12 redundant places.
[2024-06-14 14:59:41,484 INFO L231 Difference]: Finished difference. Result has 252 places, 236 transitions, 2970 flow
[2024-06-14 14:59:41,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2816, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2970, PETRI_PLACES=252, PETRI_TRANSITIONS=236}
[2024-06-14 14:59:41,485 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 222 predicate places.
[2024-06-14 14:59:41,485 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 236 transitions, 2970 flow
[2024-06-14 14:59:41,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:41,485 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:41,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:59:41,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89
[2024-06-14 14:59:41,485 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:59:41,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:41,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1818258928, now seen corresponding path program 17 times
[2024-06-14 14:59:41,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:41,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652893587]
[2024-06-14 14:59:41,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:41,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:46,964 INFO 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 14:59:46,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:46,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652893587]
[2024-06-14 14:59:46,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652893587] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:46,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:46,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 14:59:46,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741392940]
[2024-06-14 14:59:46,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:46,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 14:59:46,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:46,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 14:59:46,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-14 14:59:47,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:59:47,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 236 transitions, 2970 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:47,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:47,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:59:47,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:47,588 INFO L124 PetriNetUnfolderBase]: 647/1178 cut-off events.
[2024-06-14 14:59:47,588 INFO L125 PetriNetUnfolderBase]: For 40951/40951 co-relation queries the response was YES.
[2024-06-14 14:59:47,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7665 conditions, 1178 events. 647/1178 cut-off events. For 40951/40951 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6397 event pairs, 96 based on Foata normal form. 2/1180 useless extension candidates. Maximal degree in co-relation 7563. Up to 957 conditions per place.
[2024-06-14 14:59:47,598 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 193 selfloop transitions, 61 changer transitions 0/256 dead transitions.
[2024-06-14 14:59:47,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 256 transitions, 3576 flow
[2024-06-14 14:59:47,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:59:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:59:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions.
[2024-06-14 14:59:47,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3967741935483871
[2024-06-14 14:59:47,599 INFO L175 Difference]: Start difference. First operand has 252 places, 236 transitions, 2970 flow. Second operand 10 states and 123 transitions.
[2024-06-14 14:59:47,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 256 transitions, 3576 flow
[2024-06-14 14:59:47,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 256 transitions, 3438 flow, removed 11 selfloop flow, removed 7 redundant places.
[2024-06-14 14:59:47,697 INFO L231 Difference]: Finished difference. Result has 255 places, 240 transitions, 3028 flow
[2024-06-14 14:59:47,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2836, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3028, PETRI_PLACES=255, PETRI_TRANSITIONS=240}
[2024-06-14 14:59:47,698 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 225 predicate places.
[2024-06-14 14:59:47,698 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 240 transitions, 3028 flow
[2024-06-14 14:59:47,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:47,698 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:47,698 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 14:59:47,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90
[2024-06-14 14:59:47,699 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:59:47,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:47,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1818057118, now seen corresponding path program 18 times
[2024-06-14 14:59:47,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:47,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222305533]
[2024-06-14 14:59:47,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:47,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:59:53,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:53,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222305533]
[2024-06-14 14:59:53,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222305533] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:53,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:53,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 14:59:53,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41266984]
[2024-06-14 14:59:53,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:53,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 14:59:53,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:53,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 14:59:53,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-14 14:59:53,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:59:53,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 240 transitions, 3028 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:53,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:53,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:59:53,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:53,931 INFO L124 PetriNetUnfolderBase]: 653/1188 cut-off events.
[2024-06-14 14:59:53,931 INFO L125 PetriNetUnfolderBase]: For 41085/41085 co-relation queries the response was YES.
[2024-06-14 14:59:53,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7713 conditions, 1188 events. 653/1188 cut-off events. For 41085/41085 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6478 event pairs, 96 based on Foata normal form. 2/1190 useless extension candidates. Maximal degree in co-relation 7610. Up to 967 conditions per place.
[2024-06-14 14:59:53,940 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 195 selfloop transitions, 63 changer transitions 0/260 dead transitions.
[2024-06-14 14:59:53,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 260 transitions, 3620 flow
[2024-06-14 14:59:53,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-06-14 14:59:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-14 14:59:53,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 140 transitions.
[2024-06-14 14:59:53,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3763440860215054
[2024-06-14 14:59:53,941 INFO L175 Difference]: Start difference. First operand has 255 places, 240 transitions, 3028 flow. Second operand 12 states and 140 transitions.
[2024-06-14 14:59:53,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 260 transitions, 3620 flow
[2024-06-14 14:59:54,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 260 transitions, 3489 flow, removed 8 selfloop flow, removed 8 redundant places.
[2024-06-14 14:59:54,032 INFO L231 Difference]: Finished difference. Result has 259 places, 242 transitions, 3071 flow
[2024-06-14 14:59:54,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2897, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3071, PETRI_PLACES=259, PETRI_TRANSITIONS=242}
[2024-06-14 14:59:54,033 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 229 predicate places.
[2024-06-14 14:59:54,033 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 242 transitions, 3071 flow
[2024-06-14 14:59:54,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:54,033 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:54,033 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 14:59:54,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91
[2024-06-14 14:59:54,033 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:59:54,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:54,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1818264508, now seen corresponding path program 19 times
[2024-06-14 14:59:54,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:54,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312827635]
[2024-06-14 14:59:54,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:54,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:59,022 INFO 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 14:59:59,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:59,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312827635]
[2024-06-14 14:59:59,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312827635] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:59,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:59,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 14:59:59,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333402604]
[2024-06-14 14:59:59,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:59,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 14:59:59,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:59,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 14:59:59,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-14 14:59:59,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 14:59:59,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 242 transitions, 3071 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:59,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:59,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 14:59:59,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:59,614 INFO L124 PetriNetUnfolderBase]: 659/1198 cut-off events.
[2024-06-14 14:59:59,614 INFO L125 PetriNetUnfolderBase]: For 41125/41125 co-relation queries the response was YES.
[2024-06-14 14:59:59,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7820 conditions, 1198 events. 659/1198 cut-off events. For 41125/41125 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6507 event pairs, 90 based on Foata normal form. 2/1200 useless extension candidates. Maximal degree in co-relation 7717. Up to 921 conditions per place.
[2024-06-14 14:59:59,628 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 184 selfloop transitions, 75 changer transitions 0/261 dead transitions.
[2024-06-14 14:59:59,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 261 transitions, 3681 flow
[2024-06-14 14:59:59,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 14:59:59,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:59:59,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions.
[2024-06-14 14:59:59,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258
[2024-06-14 14:59:59,629 INFO L175 Difference]: Start difference. First operand has 259 places, 242 transitions, 3071 flow. Second operand 10 states and 126 transitions.
[2024-06-14 14:59:59,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 261 transitions, 3681 flow
[2024-06-14 14:59:59,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 261 transitions, 3532 flow, removed 10 selfloop flow, removed 11 redundant places.
[2024-06-14 14:59:59,725 INFO L231 Difference]: Finished difference. Result has 258 places, 244 transitions, 3138 flow
[2024-06-14 14:59:59,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2922, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3138, PETRI_PLACES=258, PETRI_TRANSITIONS=244}
[2024-06-14 14:59:59,726 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 228 predicate places.
[2024-06-14 14:59:59,726 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 244 transitions, 3138 flow
[2024-06-14 14:59:59,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:59,726 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:59,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:59:59,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92
[2024-06-14 14:59:59,726 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 14:59:59,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:59,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1818264663, now seen corresponding path program 24 times
[2024-06-14 14:59:59,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:59,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224837336]
[2024-06-14 14:59:59,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:59,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:05,306 INFO 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:00:05,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:05,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224837336]
[2024-06-14 15:00:05,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224837336] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:05,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:05,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:00:05,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667259110]
[2024-06-14 15:00:05,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:05,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:00:05,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:05,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:00:05,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:00:05,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:00:05,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 244 transitions, 3138 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:00:05,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:05,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:00:05,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:05,974 INFO L124 PetriNetUnfolderBase]: 663/1206 cut-off events.
[2024-06-14 15:00:05,975 INFO L125 PetriNetUnfolderBase]: For 41447/41447 co-relation queries the response was YES.
[2024-06-14 15:00:05,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7893 conditions, 1206 events. 663/1206 cut-off events. For 41447/41447 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6568 event pairs, 113 based on Foata normal form. 2/1208 useless extension candidates. Maximal degree in co-relation 7790. Up to 1079 conditions per place.
[2024-06-14 15:00:05,986 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 207 selfloop transitions, 49 changer transitions 0/258 dead transitions.
[2024-06-14 15:00:05,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 258 transitions, 3702 flow
[2024-06-14 15:00:05,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:00:05,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:00:05,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions.
[2024-06-14 15:00:05,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36070381231671556
[2024-06-14 15:00:05,987 INFO L175 Difference]: Start difference. First operand has 258 places, 244 transitions, 3138 flow. Second operand 11 states and 123 transitions.
[2024-06-14 15:00:05,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 258 transitions, 3702 flow
[2024-06-14 15:00:06,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 258 transitions, 3515 flow, removed 20 selfloop flow, removed 9 redundant places.
[2024-06-14 15:00:06,074 INFO L231 Difference]: Finished difference. Result has 260 places, 245 transitions, 3079 flow
[2024-06-14 15:00:06,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2951, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3079, PETRI_PLACES=260, PETRI_TRANSITIONS=245}
[2024-06-14 15:00:06,075 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 230 predicate places.
[2024-06-14 15:00:06,075 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 245 transitions, 3079 flow
[2024-06-14 15:00:06,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:00:06,075 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:06,075 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:00:06,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93
[2024-06-14 15:00:06,075 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:00:06,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:06,075 INFO L85 PathProgramCache]: Analyzing trace with hash -412268010, now seen corresponding path program 3 times
[2024-06-14 15:00:06,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:06,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493356830]
[2024-06-14 15:00:06,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:06,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:11,741 INFO 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:00:11,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:11,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493356830]
[2024-06-14 15:00:11,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493356830] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:11,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:11,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:00:11,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644985818]
[2024-06-14 15:00:11,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:11,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:00:11,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:11,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:00:11,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:00:11,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:00:11,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 245 transitions, 3079 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:11,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:11,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:00:11,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:12,239 INFO L124 PetriNetUnfolderBase]: 667/1214 cut-off events.
[2024-06-14 15:00:12,239 INFO L125 PetriNetUnfolderBase]: For 41155/41155 co-relation queries the response was YES.
[2024-06-14 15:00:12,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7805 conditions, 1214 events. 667/1214 cut-off events. For 41155/41155 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 6631 event pairs, 208 based on Foata normal form. 2/1216 useless extension candidates. Maximal degree in co-relation 7702. Up to 1166 conditions per place.
[2024-06-14 15:00:12,251 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 237 selfloop transitions, 18 changer transitions 0/257 dead transitions.
[2024-06-14 15:00:12,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 257 transitions, 3629 flow
[2024-06-14 15:00:12,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 15:00:12,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:00:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions.
[2024-06-14 15:00:12,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36200716845878134
[2024-06-14 15:00:12,251 INFO L175 Difference]: Start difference. First operand has 260 places, 245 transitions, 3079 flow. Second operand 9 states and 101 transitions.
[2024-06-14 15:00:12,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 257 transitions, 3629 flow
[2024-06-14 15:00:12,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 257 transitions, 3515 flow, removed 9 selfloop flow, removed 10 redundant places.
[2024-06-14 15:00:12,347 INFO L231 Difference]: Finished difference. Result has 259 places, 246 transitions, 3023 flow
[2024-06-14 15:00:12,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2965, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3023, PETRI_PLACES=259, PETRI_TRANSITIONS=246}
[2024-06-14 15:00:12,348 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 229 predicate places.
[2024-06-14 15:00:12,348 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 246 transitions, 3023 flow
[2024-06-14 15:00:12,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:12,348 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:12,349 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:00:12,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94
[2024-06-14 15:00:12,349 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:00:12,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:12,349 INFO L85 PathProgramCache]: Analyzing trace with hash 887013904, now seen corresponding path program 20 times
[2024-06-14 15:00:12,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:12,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460308327]
[2024-06-14 15:00:12,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:12,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:18,050 INFO 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:00:18,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:18,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460308327]
[2024-06-14 15:00:18,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460308327] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:18,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:18,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:00:18,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056948657]
[2024-06-14 15:00:18,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:18,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:00:18,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:18,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:00:18,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:00:18,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:00:18,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 246 transitions, 3023 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:00:18,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:18,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:00:18,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:18,758 INFO L124 PetriNetUnfolderBase]: 679/1234 cut-off events.
[2024-06-14 15:00:18,758 INFO L125 PetriNetUnfolderBase]: For 41021/41021 co-relation queries the response was YES.
[2024-06-14 15:00:18,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7842 conditions, 1234 events. 679/1234 cut-off events. For 41021/41021 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 6774 event pairs, 206 based on Foata normal form. 2/1236 useless extension candidates. Maximal degree in co-relation 7739. Up to 1167 conditions per place.
[2024-06-14 15:00:18,768 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 238 selfloop transitions, 24 changer transitions 0/264 dead transitions.
[2024-06-14 15:00:18,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 264 transitions, 3639 flow
[2024-06-14 15:00:18,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 15:00:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:00:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions.
[2024-06-14 15:00:18,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839
[2024-06-14 15:00:18,769 INFO L175 Difference]: Start difference. First operand has 259 places, 246 transitions, 3023 flow. Second operand 10 states and 115 transitions.
[2024-06-14 15:00:18,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 264 transitions, 3639 flow
[2024-06-14 15:00:18,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 264 transitions, 3585 flow, removed 8 selfloop flow, removed 8 redundant places.
[2024-06-14 15:00:18,875 INFO L231 Difference]: Finished difference. Result has 261 places, 250 transitions, 3088 flow
[2024-06-14 15:00:18,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2969, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3088, PETRI_PLACES=261, PETRI_TRANSITIONS=250}
[2024-06-14 15:00:18,877 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 231 predicate places.
[2024-06-14 15:00:18,877 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 250 transitions, 3088 flow
[2024-06-14 15:00:18,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:00:18,877 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:18,877 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:00:18,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95
[2024-06-14 15:00:18,877 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:00:18,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:18,878 INFO L85 PathProgramCache]: Analyzing trace with hash 354611688, now seen corresponding path program 21 times
[2024-06-14 15:00:18,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:18,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597459033]
[2024-06-14 15:00:18,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:18,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:23,816 INFO 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:00:23,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:23,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597459033]
[2024-06-14 15:00:23,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597459033] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:23,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:23,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:00:23,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338905547]
[2024-06-14 15:00:23,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:23,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:00:23,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:23,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:00:23,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:00:23,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:00:24,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 250 transitions, 3088 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:00:24,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:24,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:00:24,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:24,560 INFO L124 PetriNetUnfolderBase]: 685/1244 cut-off events.
[2024-06-14 15:00:24,560 INFO L125 PetriNetUnfolderBase]: For 42425/42425 co-relation queries the response was YES.
[2024-06-14 15:00:24,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7943 conditions, 1244 events. 685/1244 cut-off events. For 42425/42425 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 6849 event pairs, 208 based on Foata normal form. 2/1246 useless extension candidates. Maximal degree in co-relation 7840. Up to 1177 conditions per place.
[2024-06-14 15:00:24,571 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 241 selfloop transitions, 25 changer transitions 0/268 dead transitions.
[2024-06-14 15:00:24,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 268 transitions, 3698 flow
[2024-06-14 15:00:24,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-06-14 15:00:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-14 15:00:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 131 transitions.
[2024-06-14 15:00:24,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3521505376344086
[2024-06-14 15:00:24,572 INFO L175 Difference]: Start difference. First operand has 261 places, 250 transitions, 3088 flow. Second operand 12 states and 131 transitions.
[2024-06-14 15:00:24,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 268 transitions, 3698 flow
[2024-06-14 15:00:24,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 268 transitions, 3629 flow, removed 13 selfloop flow, removed 7 redundant places.
[2024-06-14 15:00:24,681 INFO L231 Difference]: Finished difference. Result has 266 places, 252 transitions, 3122 flow
[2024-06-14 15:00:24,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3019, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3122, PETRI_PLACES=266, PETRI_TRANSITIONS=252}
[2024-06-14 15:00:24,681 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 236 predicate places.
[2024-06-14 15:00:24,681 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 252 transitions, 3122 flow
[2024-06-14 15:00:24,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:00:24,682 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:24,682 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:00:24,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96
[2024-06-14 15:00:24,682 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:00:24,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:24,682 INFO L85 PathProgramCache]: Analyzing trace with hash 887008324, now seen corresponding path program 22 times
[2024-06-14 15:00:24,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:24,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707877965]
[2024-06-14 15:00:24,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:24,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:29,699 INFO 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:00:29,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:29,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707877965]
[2024-06-14 15:00:29,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707877965] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:29,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:29,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:00:29,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982856408]
[2024-06-14 15:00:29,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:29,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:00:29,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:29,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:00:29,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:00:29,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:00:29,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 252 transitions, 3122 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:00:29,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:29,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:00:29,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:30,377 INFO L124 PetriNetUnfolderBase]: 691/1254 cut-off events.
[2024-06-14 15:00:30,377 INFO L125 PetriNetUnfolderBase]: For 44133/44133 co-relation queries the response was YES.
[2024-06-14 15:00:30,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8049 conditions, 1254 events. 691/1254 cut-off events. For 44133/44133 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 6898 event pairs, 201 based on Foata normal form. 2/1256 useless extension candidates. Maximal degree in co-relation 7945. Up to 1156 conditions per place.
[2024-06-14 15:00:30,389 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 235 selfloop transitions, 32 changer transitions 0/269 dead transitions.
[2024-06-14 15:00:30,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 269 transitions, 3746 flow
[2024-06-14 15:00:30,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 15:00:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:00:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions.
[2024-06-14 15:00:30,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38064516129032255
[2024-06-14 15:00:30,390 INFO L175 Difference]: Start difference. First operand has 266 places, 252 transitions, 3122 flow. Second operand 10 states and 118 transitions.
[2024-06-14 15:00:30,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 269 transitions, 3746 flow
[2024-06-14 15:00:30,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 269 transitions, 3666 flow, removed 15 selfloop flow, removed 10 redundant places.
[2024-06-14 15:00:30,494 INFO L231 Difference]: Finished difference. Result has 266 places, 254 transitions, 3173 flow
[2024-06-14 15:00:30,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3042, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3173, PETRI_PLACES=266, PETRI_TRANSITIONS=254}
[2024-06-14 15:00:30,495 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 236 predicate places.
[2024-06-14 15:00:30,495 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 254 transitions, 3173 flow
[2024-06-14 15:00:30,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:00:30,495 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:30,495 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:00:30,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97
[2024-06-14 15:00:30,495 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:00:30,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:30,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1170387254, now seen corresponding path program 23 times
[2024-06-14 15:00:30,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:30,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409584321]
[2024-06-14 15:00:30,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:30,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:36,648 INFO 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:00:36,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:36,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409584321]
[2024-06-14 15:00:36,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409584321] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:36,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:36,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:00:36,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763268651]
[2024-06-14 15:00:36,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:36,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:00:36,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:36,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:00:36,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:00:36,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:00:36,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 254 transitions, 3173 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:00:36,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:36,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:00:36,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:37,243 INFO L124 PetriNetUnfolderBase]: 703/1274 cut-off events.
[2024-06-14 15:00:37,243 INFO L125 PetriNetUnfolderBase]: For 45857/45857 co-relation queries the response was YES.
[2024-06-14 15:00:37,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8209 conditions, 1274 events. 703/1274 cut-off events. For 45857/45857 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 7044 event pairs, 212 based on Foata normal form. 2/1276 useless extension candidates. Maximal degree in co-relation 8104. Up to 1219 conditions per place.
[2024-06-14 15:00:37,255 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 248 selfloop transitions, 20 changer transitions 0/270 dead transitions.
[2024-06-14 15:00:37,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 270 transitions, 3805 flow
[2024-06-14 15:00:37,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 15:00:37,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:00:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions.
[2024-06-14 15:00:37,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194
[2024-06-14 15:00:37,256 INFO L175 Difference]: Start difference. First operand has 266 places, 254 transitions, 3173 flow. Second operand 10 states and 110 transitions.
[2024-06-14 15:00:37,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 270 transitions, 3805 flow
[2024-06-14 15:00:37,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 270 transitions, 3698 flow, removed 23 selfloop flow, removed 8 redundant places.
[2024-06-14 15:00:37,371 INFO L231 Difference]: Finished difference. Result has 268 places, 258 transitions, 3185 flow
[2024-06-14 15:00:37,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3066, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3185, PETRI_PLACES=268, PETRI_TRANSITIONS=258}
[2024-06-14 15:00:37,371 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 238 predicate places.
[2024-06-14 15:00:37,371 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 258 transitions, 3185 flow
[2024-06-14 15:00:37,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:00:37,372 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:37,372 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:00:37,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98
[2024-06-14 15:00:37,372 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:00:37,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:37,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1170379318, now seen corresponding path program 4 times
[2024-06-14 15:00:37,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:37,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902105463]
[2024-06-14 15:00:37,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:37,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:42,594 INFO 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:00:42,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:42,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902105463]
[2024-06-14 15:00:42,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902105463] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:42,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:42,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:00:42,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789599117]
[2024-06-14 15:00:42,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:42,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:00:42,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:42,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:00:42,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:00:42,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:00:42,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 258 transitions, 3185 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:00:42,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:42,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:00:42,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:43,143 INFO L124 PetriNetUnfolderBase]: 707/1282 cut-off events.
[2024-06-14 15:00:43,143 INFO L125 PetriNetUnfolderBase]: For 46759/46759 co-relation queries the response was YES.
[2024-06-14 15:00:43,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8193 conditions, 1282 events. 707/1282 cut-off events. For 46759/46759 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 7085 event pairs, 216 based on Foata normal form. 2/1284 useless extension candidates. Maximal degree in co-relation 8087. Up to 1246 conditions per place.
[2024-06-14 15:00:43,156 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 253 selfloop transitions, 14 changer transitions 0/269 dead transitions.
[2024-06-14 15:00:43,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 269 transitions, 3759 flow
[2024-06-14 15:00:43,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 15:00:43,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:00:43,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions.
[2024-06-14 15:00:43,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34767025089605735
[2024-06-14 15:00:43,158 INFO L175 Difference]: Start difference. First operand has 268 places, 258 transitions, 3185 flow. Second operand 9 states and 97 transitions.
[2024-06-14 15:00:43,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 269 transitions, 3759 flow
[2024-06-14 15:00:43,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 269 transitions, 3687 flow, removed 19 selfloop flow, removed 7 redundant places.
[2024-06-14 15:00:43,270 INFO L231 Difference]: Finished difference. Result has 270 places, 259 transitions, 3165 flow
[2024-06-14 15:00:43,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3113, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3165, PETRI_PLACES=270, PETRI_TRANSITIONS=259}
[2024-06-14 15:00:43,270 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 240 predicate places.
[2024-06-14 15:00:43,270 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 259 transitions, 3165 flow
[2024-06-14 15:00:43,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:00:43,271 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:43,271 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:00:43,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99
[2024-06-14 15:00:43,271 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:00:43,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:43,271 INFO L85 PathProgramCache]: Analyzing trace with hash -913878808, now seen corresponding path program 5 times
[2024-06-14 15:00:43,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:43,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016815628]
[2024-06-14 15:00:43,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:43,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:00:48,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:48,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016815628]
[2024-06-14 15:00:48,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016815628] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:48,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:48,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:00:48,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677934144]
[2024-06-14 15:00:48,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:48,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:00:48,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:48,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:00:48,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:00:48,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:00:48,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 259 transitions, 3165 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:00:48,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:48,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:00:48,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:48,915 INFO L124 PetriNetUnfolderBase]: 711/1290 cut-off events.
[2024-06-14 15:00:48,915 INFO L125 PetriNetUnfolderBase]: For 48037/48037 co-relation queries the response was YES.
[2024-06-14 15:00:48,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8203 conditions, 1290 events. 711/1290 cut-off events. For 48037/48037 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 7148 event pairs, 213 based on Foata normal form. 2/1292 useless extension candidates. Maximal degree in co-relation 8097. Up to 1249 conditions per place.
[2024-06-14 15:00:48,926 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 255 selfloop transitions, 14 changer transitions 0/271 dead transitions.
[2024-06-14 15:00:48,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 271 transitions, 3747 flow
[2024-06-14 15:00:48,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 15:00:48,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:00:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions.
[2024-06-14 15:00:48,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834
[2024-06-14 15:00:48,931 INFO L175 Difference]: Start difference. First operand has 270 places, 259 transitions, 3165 flow. Second operand 9 states and 98 transitions.
[2024-06-14 15:00:48,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 271 transitions, 3747 flow
[2024-06-14 15:00:49,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 271 transitions, 3704 flow, removed 8 selfloop flow, removed 7 redundant places.
[2024-06-14 15:00:49,036 INFO L231 Difference]: Finished difference. Result has 272 places, 260 transitions, 3176 flow
[2024-06-14 15:00:49,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3122, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3176, PETRI_PLACES=272, PETRI_TRANSITIONS=260}
[2024-06-14 15:00:49,037 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 242 predicate places.
[2024-06-14 15:00:49,037 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 260 transitions, 3176 flow
[2024-06-14 15:00:49,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:00:49,037 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:49,038 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:00:49,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100
[2024-06-14 15:00:49,038 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:00:49,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:49,038 INFO L85 PathProgramCache]: Analyzing trace with hash -913886744, now seen corresponding path program 24 times
[2024-06-14 15:00:49,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:49,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097504476]
[2024-06-14 15:00:49,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:49,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:53,928 INFO 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:00:53,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:53,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097504476]
[2024-06-14 15:00:53,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097504476] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:53,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:53,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:00:53,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094015277]
[2024-06-14 15:00:53,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:53,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:00:53,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:53,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:00:53,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:00:54,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:00:54,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 260 transitions, 3176 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:00:54,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:54,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:00:54,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:54,565 INFO L124 PetriNetUnfolderBase]: 707/1284 cut-off events.
[2024-06-14 15:00:54,565 INFO L125 PetriNetUnfolderBase]: For 45654/45654 co-relation queries the response was YES.
[2024-06-14 15:00:54,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8056 conditions, 1284 events. 707/1284 cut-off events. For 45654/45654 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 7139 event pairs, 213 based on Foata normal form. 2/1286 useless extension candidates. Maximal degree in co-relation 7949. Up to 1233 conditions per place.
[2024-06-14 15:00:54,576 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 254 selfloop transitions, 17 changer transitions 0/273 dead transitions.
[2024-06-14 15:00:54,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 273 transitions, 3746 flow
[2024-06-14 15:00:54,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 15:00:54,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:00:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions.
[2024-06-14 15:00:54,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35161290322580646
[2024-06-14 15:00:54,577 INFO L175 Difference]: Start difference. First operand has 272 places, 260 transitions, 3176 flow. Second operand 10 states and 109 transitions.
[2024-06-14 15:00:54,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 273 transitions, 3746 flow
[2024-06-14 15:00:54,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 273 transitions, 3702 flow, removed 9 selfloop flow, removed 7 redundant places.
[2024-06-14 15:00:54,685 INFO L231 Difference]: Finished difference. Result has 275 places, 260 transitions, 3171 flow
[2024-06-14 15:00:54,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3132, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3171, PETRI_PLACES=275, PETRI_TRANSITIONS=260}
[2024-06-14 15:00:54,685 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 245 predicate places.
[2024-06-14 15:00:54,685 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 260 transitions, 3171 flow
[2024-06-14 15:00:54,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:00:54,685 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:54,685 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:00:54,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101
[2024-06-14 15:00:54,686 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:00:54,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:54,686 INFO L85 PathProgramCache]: Analyzing trace with hash 354404143, now seen corresponding path program 25 times
[2024-06-14 15:00:54,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:54,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310013902]
[2024-06-14 15:00:54,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:54,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:00,142 INFO 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:01:00,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:00,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310013902]
[2024-06-14 15:01:00,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310013902] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:00,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:00,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:01:00,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139024829]
[2024-06-14 15:01:00,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:00,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:01:00,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:00,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:01:00,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:01:00,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:01:00,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 260 transitions, 3171 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:01:00,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:00,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:01:00,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:00,869 INFO L124 PetriNetUnfolderBase]: 711/1292 cut-off events.
[2024-06-14 15:01:00,869 INFO L125 PetriNetUnfolderBase]: For 47150/47150 co-relation queries the response was YES.
[2024-06-14 15:01:00,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8113 conditions, 1292 events. 711/1292 cut-off events. For 47150/47150 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 7183 event pairs, 219 based on Foata normal form. 2/1294 useless extension candidates. Maximal degree in co-relation 8005. Up to 1250 conditions per place.
[2024-06-14 15:01:00,880 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 250 selfloop transitions, 20 changer transitions 0/272 dead transitions.
[2024-06-14 15:01:00,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 272 transitions, 3759 flow
[2024-06-14 15:01:00,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:01:00,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:01:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions.
[2024-06-14 15:01:00,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33724340175953077
[2024-06-14 15:01:00,881 INFO L175 Difference]: Start difference. First operand has 275 places, 260 transitions, 3171 flow. Second operand 11 states and 115 transitions.
[2024-06-14 15:01:00,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 272 transitions, 3759 flow
[2024-06-14 15:01:00,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 272 transitions, 3708 flow, removed 10 selfloop flow, removed 8 redundant places.
[2024-06-14 15:01:01,002 INFO L231 Difference]: Finished difference. Result has 278 places, 261 transitions, 3190 flow
[2024-06-14 15:01:01,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3120, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3190, PETRI_PLACES=278, PETRI_TRANSITIONS=261}
[2024-06-14 15:01:01,003 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 248 predicate places.
[2024-06-14 15:01:01,003 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 261 transitions, 3190 flow
[2024-06-14 15:01:01,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:01:01,003 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:01,003 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:01:01,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102
[2024-06-14 15:01:01,003 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:01:01,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:01,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1170589064, now seen corresponding path program 25 times
[2024-06-14 15:01:01,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:01,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440360809]
[2024-06-14 15:01:01,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:01,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:01:06,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:06,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440360809]
[2024-06-14 15:01:06,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440360809] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:06,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:06,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:01:06,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784677533]
[2024-06-14 15:01:06,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:06,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:01:06,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:06,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:01:06,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:01:06,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:01:06,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 261 transitions, 3190 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:01:06,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:06,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:01:06,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:06,645 INFO L124 PetriNetUnfolderBase]: 707/1286 cut-off events.
[2024-06-14 15:01:06,646 INFO L125 PetriNetUnfolderBase]: For 44550/44550 co-relation queries the response was YES.
[2024-06-14 15:01:06,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7943 conditions, 1286 events. 707/1286 cut-off events. For 44550/44550 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 7178 event pairs, 212 based on Foata normal form. 2/1288 useless extension candidates. Maximal degree in co-relation 7834. Up to 1231 conditions per place.
[2024-06-14 15:01:06,657 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 252 selfloop transitions, 20 changer transitions 0/274 dead transitions.
[2024-06-14 15:01:06,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 274 transitions, 3762 flow
[2024-06-14 15:01:06,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 15:01:06,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:01:06,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions.
[2024-06-14 15:01:06,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3580645161290323
[2024-06-14 15:01:06,658 INFO L175 Difference]: Start difference. First operand has 278 places, 261 transitions, 3190 flow. Second operand 10 states and 111 transitions.
[2024-06-14 15:01:06,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 274 transitions, 3762 flow
[2024-06-14 15:01:06,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 274 transitions, 3696 flow, removed 14 selfloop flow, removed 9 redundant places.
[2024-06-14 15:01:06,775 INFO L231 Difference]: Finished difference. Result has 279 places, 261 transitions, 3169 flow
[2024-06-14 15:01:06,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3124, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3169, PETRI_PLACES=279, PETRI_TRANSITIONS=261}
[2024-06-14 15:01:06,776 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 249 predicate places.
[2024-06-14 15:01:06,776 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 261 transitions, 3169 flow
[2024-06-14 15:01:06,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:01:06,776 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:06,776 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:01:06,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103
[2024-06-14 15:01:06,777 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:01:06,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:06,777 INFO L85 PathProgramCache]: Analyzing trace with hash -371751582, now seen corresponding path program 6 times
[2024-06-14 15:01:06,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:06,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524309104]
[2024-06-14 15:01:06,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:06,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:11,671 INFO 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:01:11,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:11,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524309104]
[2024-06-14 15:01:11,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524309104] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:11,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:11,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:01:11,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106151582]
[2024-06-14 15:01:11,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:11,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:01:11,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:11,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:01:11,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:01:11,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:01:11,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 261 transitions, 3169 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:01:11,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:11,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:01:11,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:12,264 INFO L124 PetriNetUnfolderBase]: 704/1281 cut-off events.
[2024-06-14 15:01:12,265 INFO L125 PetriNetUnfolderBase]: For 41418/41418 co-relation queries the response was YES.
[2024-06-14 15:01:12,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7766 conditions, 1281 events. 704/1281 cut-off events. For 41418/41418 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 7139 event pairs, 209 based on Foata normal form. 2/1283 useless extension candidates. Maximal degree in co-relation 7656. Up to 1240 conditions per place.
[2024-06-14 15:01:12,277 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 257 selfloop transitions, 13 changer transitions 0/272 dead transitions.
[2024-06-14 15:01:12,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 272 transitions, 3733 flow
[2024-06-14 15:01:12,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-06-14 15:01:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:01:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions.
[2024-06-14 15:01:12,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34408602150537637
[2024-06-14 15:01:12,278 INFO L175 Difference]: Start difference. First operand has 279 places, 261 transitions, 3169 flow. Second operand 9 states and 96 transitions.
[2024-06-14 15:01:12,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 272 transitions, 3733 flow
[2024-06-14 15:01:12,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 272 transitions, 3607 flow, removed 14 selfloop flow, removed 10 redundant places.
[2024-06-14 15:01:12,399 INFO L231 Difference]: Finished difference. Result has 278 places, 261 transitions, 3073 flow
[2024-06-14 15:01:12,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3043, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3073, PETRI_PLACES=278, PETRI_TRANSITIONS=261}
[2024-06-14 15:01:12,399 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 248 predicate places.
[2024-06-14 15:01:12,399 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 261 transitions, 3073 flow
[2024-06-14 15:01:12,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:01:12,400 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:12,400 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:01:12,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104
[2024-06-14 15:01:12,400 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:01:12,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:12,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1170594799, now seen corresponding path program 26 times
[2024-06-14 15:01:12,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:12,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588587550]
[2024-06-14 15:01:12,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:12,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:17,649 INFO 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:01:17,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:17,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588587550]
[2024-06-14 15:01:17,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588587550] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:17,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:17,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:01:17,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857781228]
[2024-06-14 15:01:17,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:17,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:01:17,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:17,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:01:17,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:01:17,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:01:17,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 261 transitions, 3073 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:01:17,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:17,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:01:17,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:18,271 INFO L124 PetriNetUnfolderBase]: 701/1276 cut-off events.
[2024-06-14 15:01:18,272 INFO L125 PetriNetUnfolderBase]: For 38127/38127 co-relation queries the response was YES.
[2024-06-14 15:01:18,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7506 conditions, 1276 events. 701/1276 cut-off events. For 38127/38127 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 7124 event pairs, 216 based on Foata normal form. 2/1278 useless extension candidates. Maximal degree in co-relation 7395. Up to 1240 conditions per place.
[2024-06-14 15:01:18,284 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 253 selfloop transitions, 16 changer transitions 0/271 dead transitions.
[2024-06-14 15:01:18,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 271 transitions, 3633 flow
[2024-06-14 15:01:18,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 15:01:18,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:01:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions.
[2024-06-14 15:01:18,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3387096774193548
[2024-06-14 15:01:18,285 INFO L175 Difference]: Start difference. First operand has 278 places, 261 transitions, 3073 flow. Second operand 10 states and 105 transitions.
[2024-06-14 15:01:18,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 271 transitions, 3633 flow
[2024-06-14 15:01:18,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 271 transitions, 3561 flow, removed 16 selfloop flow, removed 8 redundant places.
[2024-06-14 15:01:18,396 INFO L231 Difference]: Finished difference. Result has 280 places, 261 transitions, 3037 flow
[2024-06-14 15:01:18,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=3001, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3037, PETRI_PLACES=280, PETRI_TRANSITIONS=261}
[2024-06-14 15:01:18,396 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 250 predicate places.
[2024-06-14 15:01:18,396 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 261 transitions, 3037 flow
[2024-06-14 15:01:18,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:01:18,397 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:18,397 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:01:18,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105
[2024-06-14 15:01:18,397 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:01:18,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:18,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1170594644, now seen corresponding path program 26 times
[2024-06-14 15:01:18,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:18,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863808981]
[2024-06-14 15:01:18,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:18,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:23,572 INFO 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:01:23,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:23,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863808981]
[2024-06-14 15:01:23,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863808981] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:23,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:23,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:01:23,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692076477]
[2024-06-14 15:01:23,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:23,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:01:23,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:23,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:01:23,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:01:23,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:01:23,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 261 transitions, 3037 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:01:23,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:23,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:01:23,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:24,201 INFO L124 PetriNetUnfolderBase]: 697/1270 cut-off events.
[2024-06-14 15:01:24,201 INFO L125 PetriNetUnfolderBase]: For 34283/34283 co-relation queries the response was YES.
[2024-06-14 15:01:24,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7250 conditions, 1270 events. 697/1270 cut-off events. For 34283/34283 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 7100 event pairs, 203 based on Foata normal form. 2/1272 useless extension candidates. Maximal degree in co-relation 7139. Up to 1168 conditions per place.
[2024-06-14 15:01:24,211 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 241 selfloop transitions, 32 changer transitions 0/275 dead transitions.
[2024-06-14 15:01:24,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 275 transitions, 3613 flow
[2024-06-14 15:01:24,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 15:01:24,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:01:24,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions.
[2024-06-14 15:01:24,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36774193548387096
[2024-06-14 15:01:24,212 INFO L175 Difference]: Start difference. First operand has 280 places, 261 transitions, 3037 flow. Second operand 10 states and 114 transitions.
[2024-06-14 15:01:24,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 275 transitions, 3613 flow
[2024-06-14 15:01:24,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 275 transitions, 3443 flow, removed 18 selfloop flow, removed 10 redundant places.
[2024-06-14 15:01:24,304 INFO L231 Difference]: Finished difference. Result has 280 places, 261 transitions, 2936 flow
[2024-06-14 15:01:24,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2867, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2936, PETRI_PLACES=280, PETRI_TRANSITIONS=261}
[2024-06-14 15:01:24,304 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 250 predicate places.
[2024-06-14 15:01:24,304 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 261 transitions, 2936 flow
[2024-06-14 15:01:24,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have 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:01:24,305 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:24,305 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:01:24,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106
[2024-06-14 15:01:24,305 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:01:24,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:24,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1839162242, now seen corresponding path program 1 times
[2024-06-14 15:01:24,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:24,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927413181]
[2024-06-14 15:01:24,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:24,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:29,706 INFO 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:01:29,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:29,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927413181]
[2024-06-14 15:01:29,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927413181] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:29,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:29,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:01:29,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852891418]
[2024-06-14 15:01:29,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:29,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:01:29,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:29,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:01:29,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:01:29,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:01:29,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 261 transitions, 2936 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:29,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:29,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:01:29,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:30,341 INFO L124 PetriNetUnfolderBase]: 738/1357 cut-off events.
[2024-06-14 15:01:30,342 INFO L125 PetriNetUnfolderBase]: For 69950/69950 co-relation queries the response was YES.
[2024-06-14 15:01:30,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8105 conditions, 1357 events. 738/1357 cut-off events. For 69950/69950 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 7678 event pairs, 133 based on Foata normal form. 8/1365 useless extension candidates. Maximal degree in co-relation 7993. Up to 746 conditions per place.
[2024-06-14 15:01:30,353 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 200 selfloop transitions, 74 changer transitions 15/291 dead transitions.
[2024-06-14 15:01:30,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 291 transitions, 3758 flow
[2024-06-14 15:01:30,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:01:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:01:30,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions.
[2024-06-14 15:01:30,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252199413489736
[2024-06-14 15:01:30,354 INFO L175 Difference]: Start difference. First operand has 280 places, 261 transitions, 2936 flow. Second operand 11 states and 145 transitions.
[2024-06-14 15:01:30,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 291 transitions, 3758 flow
[2024-06-14 15:01:30,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 291 transitions, 3441 flow, removed 12 selfloop flow, removed 11 redundant places.
[2024-06-14 15:01:30,497 INFO L231 Difference]: Finished difference. Result has 280 places, 256 transitions, 2706 flow
[2024-06-14 15:01:30,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2619, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2706, PETRI_PLACES=280, PETRI_TRANSITIONS=256}
[2024-06-14 15:01:30,498 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 250 predicate places.
[2024-06-14 15:01:30,498 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 256 transitions, 2706 flow
[2024-06-14 15:01:30,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:30,498 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:30,498 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:01:30,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107
[2024-06-14 15:01:30,499 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:01:30,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:30,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1489987466, now seen corresponding path program 2 times
[2024-06-14 15:01:30,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:30,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020928193]
[2024-06-14 15:01:30,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:30,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:35,860 INFO 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:01:35,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:35,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020928193]
[2024-06-14 15:01:35,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020928193] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:35,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:35,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:01:35,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498172248]
[2024-06-14 15:01:35,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:35,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:01:35,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:35,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:01:35,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:01:35,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:01:35,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 256 transitions, 2706 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:35,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:35,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:01:35,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:36,461 INFO L124 PetriNetUnfolderBase]: 747/1384 cut-off events.
[2024-06-14 15:01:36,461 INFO L125 PetriNetUnfolderBase]: For 94703/94703 co-relation queries the response was YES.
[2024-06-14 15:01:36,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8594 conditions, 1384 events. 747/1384 cut-off events. For 94703/94703 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 7858 event pairs, 142 based on Foata normal form. 8/1392 useless extension candidates. Maximal degree in co-relation 8482. Up to 949 conditions per place.
[2024-06-14 15:01:36,475 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 198 selfloop transitions, 75 changer transitions 10/285 dead transitions.
[2024-06-14 15:01:36,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 285 transitions, 3514 flow
[2024-06-14 15:01:36,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:01:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:01:36,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions.
[2024-06-14 15:01:36,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281524926686217
[2024-06-14 15:01:36,476 INFO L175 Difference]: Start difference. First operand has 280 places, 256 transitions, 2706 flow. Second operand 11 states and 146 transitions.
[2024-06-14 15:01:36,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 285 transitions, 3514 flow
[2024-06-14 15:01:36,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 285 transitions, 3351 flow, removed 4 selfloop flow, removed 9 redundant places.
[2024-06-14 15:01:36,654 INFO L231 Difference]: Finished difference. Result has 277 places, 253 transitions, 2661 flow
[2024-06-14 15:01:36,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2545, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2661, PETRI_PLACES=277, PETRI_TRANSITIONS=253}
[2024-06-14 15:01:36,654 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 247 predicate places.
[2024-06-14 15:01:36,654 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 253 transitions, 2661 flow
[2024-06-14 15:01:36,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:36,655 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:36,655 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:01:36,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108
[2024-06-14 15:01:36,655 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:01:36,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:36,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1490107436, now seen corresponding path program 3 times
[2024-06-14 15:01:36,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:36,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808914858]
[2024-06-14 15:01:36,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:36,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:01:42,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:42,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808914858]
[2024-06-14 15:01:42,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808914858] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:42,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:42,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:01:42,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237241296]
[2024-06-14 15:01:42,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:42,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:01:42,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:42,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:01:42,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:01:42,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:01:42,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 253 transitions, 2661 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:42,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:42,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:01:42,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:42,598 INFO L124 PetriNetUnfolderBase]: 734/1361 cut-off events.
[2024-06-14 15:01:42,599 INFO L125 PetriNetUnfolderBase]: For 94506/94506 co-relation queries the response was YES.
[2024-06-14 15:01:42,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8328 conditions, 1361 events. 734/1361 cut-off events. For 94506/94506 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 7730 event pairs, 153 based on Foata normal form. 10/1371 useless extension candidates. Maximal degree in co-relation 8218. Up to 1005 conditions per place.
[2024-06-14 15:01:42,612 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 189 selfloop transitions, 74 changer transitions 11/276 dead transitions.
[2024-06-14 15:01:42,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 276 transitions, 3289 flow
[2024-06-14 15:01:42,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:01:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:01:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions.
[2024-06-14 15:01:42,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046920821114369
[2024-06-14 15:01:42,613 INFO L175 Difference]: Start difference. First operand has 277 places, 253 transitions, 2661 flow. Second operand 11 states and 138 transitions.
[2024-06-14 15:01:42,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 276 transitions, 3289 flow
[2024-06-14 15:01:42,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 276 transitions, 3138 flow, removed 2 selfloop flow, removed 8 redundant places.
[2024-06-14 15:01:42,756 INFO L231 Difference]: Finished difference. Result has 276 places, 250 transitions, 2631 flow
[2024-06-14 15:01:42,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2510, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2631, PETRI_PLACES=276, PETRI_TRANSITIONS=250}
[2024-06-14 15:01:42,756 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 246 predicate places.
[2024-06-14 15:01:42,756 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 250 transitions, 2631 flow
[2024-06-14 15:01:42,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:42,757 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:42,757 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:01:42,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109
[2024-06-14 15:01:42,757 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:01:42,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:42,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1744086420, now seen corresponding path program 4 times
[2024-06-14 15:01:42,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:42,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215380263]
[2024-06-14 15:01:42,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:42,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:48,024 INFO 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:01:48,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:48,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215380263]
[2024-06-14 15:01:48,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215380263] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:48,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:48,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:01:48,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410669330]
[2024-06-14 15:01:48,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:48,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:01:48,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:48,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:01:48,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:01:48,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:01:48,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 250 transitions, 2631 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:48,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:48,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:01:48,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:48,614 INFO L124 PetriNetUnfolderBase]: 700/1295 cut-off events.
[2024-06-14 15:01:48,614 INFO L125 PetriNetUnfolderBase]: For 71558/71558 co-relation queries the response was YES.
[2024-06-14 15:01:48,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7544 conditions, 1295 events. 700/1295 cut-off events. For 71558/71558 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 7284 event pairs, 131 based on Foata normal form. 8/1303 useless extension candidates. Maximal degree in co-relation 7434. Up to 949 conditions per place.
[2024-06-14 15:01:48,625 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 185 selfloop transitions, 69 changer transitions 16/272 dead transitions.
[2024-06-14 15:01:48,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 272 transitions, 3237 flow
[2024-06-14 15:01:48,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:01:48,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:01:48,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions.
[2024-06-14 15:01:48,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39589442815249265
[2024-06-14 15:01:48,626 INFO L175 Difference]: Start difference. First operand has 276 places, 250 transitions, 2631 flow. Second operand 11 states and 135 transitions.
[2024-06-14 15:01:48,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 272 transitions, 3237 flow
[2024-06-14 15:01:48,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 272 transitions, 3083 flow, removed 3 selfloop flow, removed 9 redundant places.
[2024-06-14 15:01:48,757 INFO L231 Difference]: Finished difference. Result has 275 places, 244 transitions, 2545 flow
[2024-06-14 15:01:48,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2477, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2545, PETRI_PLACES=275, PETRI_TRANSITIONS=244}
[2024-06-14 15:01:48,758 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 245 predicate places.
[2024-06-14 15:01:48,758 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 244 transitions, 2545 flow
[2024-06-14 15:01:48,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:48,758 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:48,758 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:01:48,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110
[2024-06-14 15:01:48,759 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:01:48,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:48,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1678745514, now seen corresponding path program 5 times
[2024-06-14 15:01:48,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:48,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501381844]
[2024-06-14 15:01:48,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:48,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:53,923 INFO 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:01:53,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:53,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501381844]
[2024-06-14 15:01:53,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501381844] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:53,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:53,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:01:53,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460544969]
[2024-06-14 15:01:53,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:53,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:01:53,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:53,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:01:53,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:01:54,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:01:54,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 244 transitions, 2545 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:54,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:54,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:01:54,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:54,703 INFO L124 PetriNetUnfolderBase]: 717/1331 cut-off events.
[2024-06-14 15:01:54,703 INFO L125 PetriNetUnfolderBase]: For 94480/94480 co-relation queries the response was YES.
[2024-06-14 15:01:54,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8272 conditions, 1331 events. 717/1331 cut-off events. For 94480/94480 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 7510 event pairs, 134 based on Foata normal form. 8/1339 useless extension candidates. Maximal degree in co-relation 8162. Up to 1004 conditions per place.
[2024-06-14 15:01:54,716 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 207 selfloop transitions, 55 changer transitions 7/271 dead transitions.
[2024-06-14 15:01:54,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 271 transitions, 3319 flow
[2024-06-14 15:01:54,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:01:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:01:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions.
[2024-06-14 15:01:54,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744
[2024-06-14 15:01:54,717 INFO L175 Difference]: Start difference. First operand has 275 places, 244 transitions, 2545 flow. Second operand 11 states and 143 transitions.
[2024-06-14 15:01:54,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 271 transitions, 3319 flow
[2024-06-14 15:01:54,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 271 transitions, 3164 flow, removed 4 selfloop flow, removed 8 redundant places.
[2024-06-14 15:01:54,880 INFO L231 Difference]: Finished difference. Result has 270 places, 242 transitions, 2482 flow
[2024-06-14 15:01:54,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2392, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2482, PETRI_PLACES=270, PETRI_TRANSITIONS=242}
[2024-06-14 15:01:54,880 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 240 predicate places.
[2024-06-14 15:01:54,881 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 242 transitions, 2482 flow
[2024-06-14 15:01:54,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:54,881 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:54,881 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:01:54,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111
[2024-06-14 15:01:54,881 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:01:54,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:54,881 INFO L85 PathProgramCache]: Analyzing trace with hash -818082396, now seen corresponding path program 6 times
[2024-06-14 15:01:54,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:54,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608436712]
[2024-06-14 15:01:54,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:54,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:00,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:02:00,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:00,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608436712]
[2024-06-14 15:02:00,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608436712] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:00,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:00,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:02:00,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077257002]
[2024-06-14 15:02:00,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:00,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:02:00,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:00,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:02:00,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:02:00,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:02:00,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 242 transitions, 2482 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:00,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:00,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:02:00,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:00,814 INFO L124 PetriNetUnfolderBase]: 686/1270 cut-off events.
[2024-06-14 15:02:00,814 INFO L125 PetriNetUnfolderBase]: For 76145/76145 co-relation queries the response was YES.
[2024-06-14 15:02:00,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7327 conditions, 1270 events. 686/1270 cut-off events. For 76145/76145 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 7132 event pairs, 125 based on Foata normal form. 10/1280 useless extension candidates. Maximal degree in co-relation 7218. Up to 1004 conditions per place.
[2024-06-14 15:02:00,826 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 197 selfloop transitions, 52 changer transitions 13/264 dead transitions.
[2024-06-14 15:02:00,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 264 transitions, 3082 flow
[2024-06-14 15:02:00,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:02:00,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:02:00,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions.
[2024-06-14 15:02:00,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40175953079178883
[2024-06-14 15:02:00,827 INFO L175 Difference]: Start difference. First operand has 270 places, 242 transitions, 2482 flow. Second operand 11 states and 137 transitions.
[2024-06-14 15:02:00,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 264 transitions, 3082 flow
[2024-06-14 15:02:00,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 264 transitions, 2970 flow, removed 2 selfloop flow, removed 9 redundant places.
[2024-06-14 15:02:00,975 INFO L231 Difference]: Finished difference. Result has 270 places, 238 transitions, 2431 flow
[2024-06-14 15:02:00,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2370, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2431, PETRI_PLACES=270, PETRI_TRANSITIONS=238}
[2024-06-14 15:02:00,975 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 240 predicate places.
[2024-06-14 15:02:00,975 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 238 transitions, 2431 flow
[2024-06-14 15:02:00,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:00,976 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:00,976 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:02:00,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112
[2024-06-14 15:02:00,976 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:02:00,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1883329136, now seen corresponding path program 7 times
[2024-06-14 15:02:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:00,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566405322]
[2024-06-14 15:02:00,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:00,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:06,440 INFO 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:02:06,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:06,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566405322]
[2024-06-14 15:02:06,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566405322] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:06,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:06,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:02:06,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704151866]
[2024-06-14 15:02:06,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:06,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:02:06,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:06,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:02:06,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:02:06,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:02:06,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 238 transitions, 2431 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:06,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:06,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:02:06,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:07,185 INFO L124 PetriNetUnfolderBase]: 677/1255 cut-off events.
[2024-06-14 15:02:07,185 INFO L125 PetriNetUnfolderBase]: For 76101/76101 co-relation queries the response was YES.
[2024-06-14 15:02:07,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7227 conditions, 1255 events. 677/1255 cut-off events. For 76101/76101 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 7010 event pairs, 125 based on Foata normal form. 10/1265 useless extension candidates. Maximal degree in co-relation 7118. Up to 986 conditions per place.
[2024-06-14 15:02:07,198 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 193 selfloop transitions, 54 changer transitions 11/260 dead transitions.
[2024-06-14 15:02:07,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 260 transitions, 3023 flow
[2024-06-14 15:02:07,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:02:07,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:02:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions.
[2024-06-14 15:02:07,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046920821114369
[2024-06-14 15:02:07,199 INFO L175 Difference]: Start difference. First operand has 270 places, 238 transitions, 2431 flow. Second operand 11 states and 138 transitions.
[2024-06-14 15:02:07,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 260 transitions, 3023 flow
[2024-06-14 15:02:07,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 260 transitions, 2909 flow, removed 5 selfloop flow, removed 8 redundant places.
[2024-06-14 15:02:07,326 INFO L231 Difference]: Finished difference. Result has 267 places, 235 transitions, 2398 flow
[2024-06-14 15:02:07,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2317, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2398, PETRI_PLACES=267, PETRI_TRANSITIONS=235}
[2024-06-14 15:02:07,326 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 237 predicate places.
[2024-06-14 15:02:07,326 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 235 transitions, 2398 flow
[2024-06-14 15:02:07,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:07,326 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:07,326 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:02:07,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113
[2024-06-14 15:02:07,327 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:02:07,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:07,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1883333786, now seen corresponding path program 8 times
[2024-06-14 15:02:07,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:07,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288454649]
[2024-06-14 15:02:07,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:07,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:02:12,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:12,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288454649]
[2024-06-14 15:02:12,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288454649] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:12,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:12,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:02:12,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405800855]
[2024-06-14 15:02:12,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:12,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:02:12,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:12,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:02:12,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:02:12,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:02:12,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 235 transitions, 2398 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:12,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:12,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:02:12,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:13,397 INFO L124 PetriNetUnfolderBase]: 665/1235 cut-off events.
[2024-06-14 15:02:13,398 INFO L125 PetriNetUnfolderBase]: For 71373/71373 co-relation queries the response was YES.
[2024-06-14 15:02:13,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7113 conditions, 1235 events. 665/1235 cut-off events. For 71373/71373 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 6881 event pairs, 121 based on Foata normal form. 8/1243 useless extension candidates. Maximal degree in co-relation 7004. Up to 976 conditions per place.
[2024-06-14 15:02:13,412 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 191 selfloop transitions, 52 changer transitions 11/256 dead transitions.
[2024-06-14 15:02:13,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 256 transitions, 2968 flow
[2024-06-14 15:02:13,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:02:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:02:13,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions.
[2024-06-14 15:02:13,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39589442815249265
[2024-06-14 15:02:13,413 INFO L175 Difference]: Start difference. First operand has 267 places, 235 transitions, 2398 flow. Second operand 11 states and 135 transitions.
[2024-06-14 15:02:13,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 256 transitions, 2968 flow
[2024-06-14 15:02:13,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 256 transitions, 2854 flow, removed 3 selfloop flow, removed 9 redundant places.
[2024-06-14 15:02:13,556 INFO L231 Difference]: Finished difference. Result has 266 places, 232 transitions, 2356 flow
[2024-06-14 15:02:13,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2284, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2356, PETRI_PLACES=266, PETRI_TRANSITIONS=232}
[2024-06-14 15:02:13,556 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 236 predicate places.
[2024-06-14 15:02:13,556 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 232 transitions, 2356 flow
[2024-06-14 15:02:13,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:13,556 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:13,557 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:02:13,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114
[2024-06-14 15:02:13,557 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:02:13,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:13,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1883449106, now seen corresponding path program 9 times
[2024-06-14 15:02:13,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:13,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657180262]
[2024-06-14 15:02:13,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:13,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:02:18,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:18,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657180262]
[2024-06-14 15:02:18,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657180262] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:18,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:18,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:02:18,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376062139]
[2024-06-14 15:02:18,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:18,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:02:18,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:18,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:02:18,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:02:19,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:02:19,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 232 transitions, 2356 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:19,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:19,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:02:19,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:19,699 INFO L124 PetriNetUnfolderBase]: 658/1222 cut-off events.
[2024-06-14 15:02:19,699 INFO L125 PetriNetUnfolderBase]: For 71351/71351 co-relation queries the response was YES.
[2024-06-14 15:02:19,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7039 conditions, 1222 events. 658/1222 cut-off events. For 71351/71351 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6764 event pairs, 119 based on Foata normal form. 8/1230 useless extension candidates. Maximal degree in co-relation 6930. Up to 958 conditions per place.
[2024-06-14 15:02:19,710 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 188 selfloop transitions, 50 changer transitions 14/254 dead transitions.
[2024-06-14 15:02:19,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 254 transitions, 2924 flow
[2024-06-14 15:02:19,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:02:19,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:02:19,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions.
[2024-06-14 15:02:19,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39589442815249265
[2024-06-14 15:02:19,711 INFO L175 Difference]: Start difference. First operand has 266 places, 232 transitions, 2356 flow. Second operand 11 states and 135 transitions.
[2024-06-14 15:02:19,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 254 transitions, 2924 flow
[2024-06-14 15:02:19,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 254 transitions, 2812 flow, removed 4 selfloop flow, removed 8 redundant places.
[2024-06-14 15:02:19,846 INFO L231 Difference]: Finished difference. Result has 264 places, 228 transitions, 2289 flow
[2024-06-14 15:02:19,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2244, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2289, PETRI_PLACES=264, PETRI_TRANSITIONS=228}
[2024-06-14 15:02:19,847 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 234 predicate places.
[2024-06-14 15:02:19,847 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 228 transitions, 2289 flow
[2024-06-14 15:02:19,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:19,847 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:19,847 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:02:19,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115
[2024-06-14 15:02:19,847 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:02:19,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:19,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1311928148, now seen corresponding path program 10 times
[2024-06-14 15:02:19,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:19,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722518598]
[2024-06-14 15:02:19,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:19,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:02:25,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:25,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722518598]
[2024-06-14 15:02:25,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722518598] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:25,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:25,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:02:25,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001427129]
[2024-06-14 15:02:25,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:25,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:02:25,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:25,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:02:25,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:02:26,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:02:26,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 228 transitions, 2289 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:26,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:26,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:02:26,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:26,574 INFO L124 PetriNetUnfolderBase]: 647/1199 cut-off events.
[2024-06-14 15:02:26,575 INFO L125 PetriNetUnfolderBase]: For 71115/71115 co-relation queries the response was YES.
[2024-06-14 15:02:26,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6911 conditions, 1199 events. 647/1199 cut-off events. For 71115/71115 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 6566 event pairs, 92 based on Foata normal form. 8/1207 useless extension candidates. Maximal degree in co-relation 6802. Up to 756 conditions per place.
[2024-06-14 15:02:26,585 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 154 selfloop transitions, 77 changer transitions 18/251 dead transitions.
[2024-06-14 15:02:26,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 251 transitions, 2855 flow
[2024-06-14 15:02:26,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:02:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:02:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions.
[2024-06-14 15:02:26,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782991202346041
[2024-06-14 15:02:26,586 INFO L175 Difference]: Start difference. First operand has 264 places, 228 transitions, 2289 flow. Second operand 11 states and 129 transitions.
[2024-06-14 15:02:26,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 251 transitions, 2855 flow
[2024-06-14 15:02:26,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 251 transitions, 2709 flow, removed 3 selfloop flow, removed 11 redundant places.
[2024-06-14 15:02:26,728 INFO L231 Difference]: Finished difference. Result has 257 places, 223 transitions, 2255 flow
[2024-06-14 15:02:26,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2143, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2255, PETRI_PLACES=257, PETRI_TRANSITIONS=223}
[2024-06-14 15:02:26,729 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 227 predicate places.
[2024-06-14 15:02:26,729 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 223 transitions, 2255 flow
[2024-06-14 15:02:26,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:26,729 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:26,729 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:02:26,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116
[2024-06-14 15:02:26,730 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:02:26,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:26,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1956000312, now seen corresponding path program 11 times
[2024-06-14 15:02:26,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:26,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523271060]
[2024-06-14 15:02:26,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:26,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:33,139 INFO 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:02:33,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:33,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523271060]
[2024-06-14 15:02:33,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523271060] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:33,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:33,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:02:33,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755234399]
[2024-06-14 15:02:33,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:33,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:02:33,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:33,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:02:33,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:02:33,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:02:33,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 223 transitions, 2255 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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:02:33,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:33,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:02:33,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:33,715 INFO L124 PetriNetUnfolderBase]: 666/1234 cut-off events.
[2024-06-14 15:02:33,716 INFO L125 PetriNetUnfolderBase]: For 98316/98316 co-relation queries the response was YES.
[2024-06-14 15:02:33,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7851 conditions, 1234 events. 666/1234 cut-off events. For 98316/98316 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 6711 event pairs, 132 based on Foata normal form. 8/1242 useless extension candidates. Maximal degree in co-relation 7743. Up to 637 conditions per place.
[2024-06-14 15:02:33,726 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 168 selfloop transitions, 66 changer transitions 14/250 dead transitions.
[2024-06-14 15:02:33,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 250 transitions, 2995 flow
[2024-06-14 15:02:33,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:02:33,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:02:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions.
[2024-06-14 15:02:33,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41348973607038125
[2024-06-14 15:02:33,727 INFO L175 Difference]: Start difference. First operand has 257 places, 223 transitions, 2255 flow. Second operand 11 states and 141 transitions.
[2024-06-14 15:02:33,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 250 transitions, 2995 flow
[2024-06-14 15:02:33,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 250 transitions, 2778 flow, removed 3 selfloop flow, removed 11 redundant places.
[2024-06-14 15:02:33,907 INFO L231 Difference]: Finished difference. Result has 250 places, 219 transitions, 2140 flow
[2024-06-14 15:02:33,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2040, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2140, PETRI_PLACES=250, PETRI_TRANSITIONS=219}
[2024-06-14 15:02:33,908 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 220 predicate places.
[2024-06-14 15:02:33,908 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 219 transitions, 2140 flow
[2024-06-14 15:02:33,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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:02:33,908 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:33,908 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:02:33,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117
[2024-06-14 15:02:33,908 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:02:33,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:33,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1065405256, now seen corresponding path program 12 times
[2024-06-14 15:02:33,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:33,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454460097]
[2024-06-14 15:02:33,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:33,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:39,525 INFO 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:02:39,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:39,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454460097]
[2024-06-14 15:02:39,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454460097] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:39,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:39,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:02:39,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058535449]
[2024-06-14 15:02:39,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:39,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:02:39,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:39,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:02:39,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:02:39,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:02:39,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 219 transitions, 2140 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:39,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:39,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:02:39,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:40,330 INFO L124 PetriNetUnfolderBase]: 665/1237 cut-off events.
[2024-06-14 15:02:40,330 INFO L125 PetriNetUnfolderBase]: For 111452/111452 co-relation queries the response was YES.
[2024-06-14 15:02:40,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8110 conditions, 1237 events. 665/1237 cut-off events. For 111452/111452 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6709 event pairs, 133 based on Foata normal form. 8/1245 useless extension candidates. Maximal degree in co-relation 8004. Up to 936 conditions per place.
[2024-06-14 15:02:40,338 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 174 selfloop transitions, 60 changer transitions 10/246 dead transitions.
[2024-06-14 15:02:40,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 246 transitions, 2866 flow
[2024-06-14 15:02:40,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-06-14 15:02:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-14 15:02:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions.
[2024-06-14 15:02:40,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484
[2024-06-14 15:02:40,339 INFO L175 Difference]: Start difference. First operand has 250 places, 219 transitions, 2140 flow. Second operand 12 states and 144 transitions.
[2024-06-14 15:02:40,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 246 transitions, 2866 flow
[2024-06-14 15:02:40,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 246 transitions, 2799 flow, removed 6 selfloop flow, removed 7 redundant places.
[2024-06-14 15:02:40,520 INFO L231 Difference]: Finished difference. Result has 250 places, 216 transitions, 2174 flow
[2024-06-14 15:02:40,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2075, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2174, PETRI_PLACES=250, PETRI_TRANSITIONS=216}
[2024-06-14 15:02:40,521 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 220 predicate places.
[2024-06-14 15:02:40,521 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 216 transitions, 2174 flow
[2024-06-14 15:02:40,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:40,521 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:40,521 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:02:40,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118
[2024-06-14 15:02:40,521 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:02:40,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:40,521 INFO L85 PathProgramCache]: Analyzing trace with hash 677641756, now seen corresponding path program 13 times
[2024-06-14 15:02:40,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:40,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372096977]
[2024-06-14 15:02:40,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:40,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:45,857 INFO 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:02:45,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:45,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372096977]
[2024-06-14 15:02:45,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372096977] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:45,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:45,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:02:45,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823494864]
[2024-06-14 15:02:45,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:45,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:02:45,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:45,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:02:45,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:02:45,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:02:45,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 216 transitions, 2174 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:45,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:45,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:02:45,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:46,549 INFO L124 PetriNetUnfolderBase]: 655/1219 cut-off events.
[2024-06-14 15:02:46,549 INFO L125 PetriNetUnfolderBase]: For 111494/111494 co-relation queries the response was YES.
[2024-06-14 15:02:46,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8091 conditions, 1219 events. 655/1219 cut-off events. For 111494/111494 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6612 event pairs, 127 based on Foata normal form. 8/1227 useless extension candidates. Maximal degree in co-relation 7986. Up to 936 conditions per place.
[2024-06-14 15:02:46,559 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 173 selfloop transitions, 60 changer transitions 7/242 dead transitions.
[2024-06-14 15:02:46,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 242 transitions, 2890 flow
[2024-06-14 15:02:46,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-06-14 15:02:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-14 15:02:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions.
[2024-06-14 15:02:46,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161
[2024-06-14 15:02:46,560 INFO L175 Difference]: Start difference. First operand has 250 places, 216 transitions, 2174 flow. Second operand 12 states and 141 transitions.
[2024-06-14 15:02:46,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 242 transitions, 2890 flow
[2024-06-14 15:02:46,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 242 transitions, 2749 flow, removed 4 selfloop flow, removed 10 redundant places.
[2024-06-14 15:02:46,764 INFO L231 Difference]: Finished difference. Result has 248 places, 214 transitions, 2139 flow
[2024-06-14 15:02:46,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2035, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2139, PETRI_PLACES=248, PETRI_TRANSITIONS=214}
[2024-06-14 15:02:46,765 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places.
[2024-06-14 15:02:46,765 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 214 transitions, 2139 flow
[2024-06-14 15:02:46,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:46,765 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:46,765 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:02:46,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119
[2024-06-14 15:02:46,765 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:02:46,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:46,766 INFO L85 PathProgramCache]: Analyzing trace with hash 677646406, now seen corresponding path program 14 times
[2024-06-14 15:02:46,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:46,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053069617]
[2024-06-14 15:02:46,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:46,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:52,509 INFO 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:02:52,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:52,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053069617]
[2024-06-14 15:02:52,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053069617] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:52,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:52,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:02:52,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719345044]
[2024-06-14 15:02:52,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:52,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:02:52,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:52,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:02:52,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:02:52,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:02:52,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 214 transitions, 2139 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:52,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:52,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:02:52,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:53,106 INFO L124 PetriNetUnfolderBase]: 624/1158 cut-off events.
[2024-06-14 15:02:53,106 INFO L125 PetriNetUnfolderBase]: For 93256/93256 co-relation queries the response was YES.
[2024-06-14 15:02:53,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7170 conditions, 1158 events. 624/1158 cut-off events. For 93256/93256 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6205 event pairs, 118 based on Foata normal form. 10/1168 useless extension candidates. Maximal degree in co-relation 7066. Up to 936 conditions per place.
[2024-06-14 15:02:53,116 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 159 selfloop transitions, 53 changer transitions 20/234 dead transitions.
[2024-06-14 15:02:53,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 234 transitions, 2677 flow
[2024-06-14 15:02:53,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:02:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:02:53,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions.
[2024-06-14 15:02:53,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724340175953079
[2024-06-14 15:02:53,118 INFO L175 Difference]: Start difference. First operand has 248 places, 214 transitions, 2139 flow. Second operand 11 states and 127 transitions.
[2024-06-14 15:02:53,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 234 transitions, 2677 flow
[2024-06-14 15:02:53,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 234 transitions, 2555 flow, removed 2 selfloop flow, removed 10 redundant places.
[2024-06-14 15:02:53,269 INFO L231 Difference]: Finished difference. Result has 247 places, 207 transitions, 2050 flow
[2024-06-14 15:02:53,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2017, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2050, PETRI_PLACES=247, PETRI_TRANSITIONS=207}
[2024-06-14 15:02:53,269 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 217 predicate places.
[2024-06-14 15:02:53,269 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 207 transitions, 2050 flow
[2024-06-14 15:02:53,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:53,269 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:53,269 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:02:53,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120
[2024-06-14 15:02:53,270 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:02:53,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:53,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1889465770, now seen corresponding path program 15 times
[2024-06-14 15:02:53,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:53,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12844885]
[2024-06-14 15:02:53,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:53,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:02:58,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:58,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12844885]
[2024-06-14 15:02:58,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12844885] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:58,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:58,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:02:58,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932791755]
[2024-06-14 15:02:58,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:58,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:02:58,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:58,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:02:58,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:02:58,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:02:58,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 207 transitions, 2050 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:58,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:58,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:02:58,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:59,297 INFO L124 PetriNetUnfolderBase]: 609/1124 cut-off events.
[2024-06-14 15:02:59,297 INFO L125 PetriNetUnfolderBase]: For 88662/88662 co-relation queries the response was YES.
[2024-06-14 15:02:59,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6984 conditions, 1124 events. 609/1124 cut-off events. For 88662/88662 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 5977 event pairs, 87 based on Foata normal form. 8/1132 useless extension candidates. Maximal degree in co-relation 6880. Up to 675 conditions per place.
[2024-06-14 15:02:59,306 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 160 selfloop transitions, 63 changer transitions 12/237 dead transitions.
[2024-06-14 15:02:59,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 237 transitions, 2768 flow
[2024-06-14 15:02:59,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:02:59,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:02:59,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions.
[2024-06-14 15:02:59,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252199413489736
[2024-06-14 15:02:59,307 INFO L175 Difference]: Start difference. First operand has 247 places, 207 transitions, 2050 flow. Second operand 11 states and 145 transitions.
[2024-06-14 15:02:59,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 237 transitions, 2768 flow
[2024-06-14 15:02:59,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 237 transitions, 2579 flow, removed 8 selfloop flow, removed 11 redundant places.
[2024-06-14 15:02:59,446 INFO L231 Difference]: Finished difference. Result has 236 places, 204 transitions, 1965 flow
[2024-06-14 15:02:59,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1965, PETRI_PLACES=236, PETRI_TRANSITIONS=204}
[2024-06-14 15:02:59,447 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 206 predicate places.
[2024-06-14 15:02:59,447 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 204 transitions, 1965 flow
[2024-06-14 15:02:59,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:59,447 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:59,447 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:02:59,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121
[2024-06-14 15:02:59,447 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:02:59,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:59,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1889581090, now seen corresponding path program 16 times
[2024-06-14 15:02:59,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:59,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805003462]
[2024-06-14 15:02:59,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:59,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:04,952 INFO 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:03:04,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:04,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805003462]
[2024-06-14 15:03:04,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805003462] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:04,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:04,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:03:04,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518544021]
[2024-06-14 15:03:04,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:04,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:03:04,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:04,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:03:04,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:03:05,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:03:05,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 204 transitions, 1965 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:05,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:05,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:03:05,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:05,596 INFO L124 PetriNetUnfolderBase]: 624/1155 cut-off events.
[2024-06-14 15:03:05,596 INFO L125 PetriNetUnfolderBase]: For 108623/108623 co-relation queries the response was YES.
[2024-06-14 15:03:05,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7644 conditions, 1155 events. 624/1155 cut-off events. For 108623/108623 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6200 event pairs, 98 based on Foata normal form. 8/1163 useless extension candidates. Maximal degree in co-relation 7542. Up to 784 conditions per place.
[2024-06-14 15:03:05,607 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 160 selfloop transitions, 63 changer transitions 8/233 dead transitions.
[2024-06-14 15:03:05,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 233 transitions, 2667 flow
[2024-06-14 15:03:05,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:03:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:03:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions.
[2024-06-14 15:03:05,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252199413489736
[2024-06-14 15:03:05,607 INFO L175 Difference]: Start difference. First operand has 236 places, 204 transitions, 1965 flow. Second operand 11 states and 145 transitions.
[2024-06-14 15:03:05,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 233 transitions, 2667 flow
[2024-06-14 15:03:05,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 233 transitions, 2546 flow, removed 5 selfloop flow, removed 9 redundant places.
[2024-06-14 15:03:05,772 INFO L231 Difference]: Finished difference. Result has 234 places, 202 transitions, 1953 flow
[2024-06-14 15:03:05,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1846, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1953, PETRI_PLACES=234, PETRI_TRANSITIONS=202}
[2024-06-14 15:03:05,772 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 204 predicate places.
[2024-06-14 15:03:05,772 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 202 transitions, 1953 flow
[2024-06-14 15:03:05,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:05,772 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:05,772 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:03:05,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122
[2024-06-14 15:03:05,772 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:03:05,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:05,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1889585740, now seen corresponding path program 17 times
[2024-06-14 15:03:05,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:05,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518546775]
[2024-06-14 15:03:05,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:05,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:11,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:03:11,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:11,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518546775]
[2024-06-14 15:03:11,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518546775] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:11,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:11,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:03:11,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509821735]
[2024-06-14 15:03:11,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:11,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:03:11,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:11,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:03:11,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:03:11,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:03:11,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 202 transitions, 1953 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:11,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:11,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:03:11,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:12,184 INFO L124 PetriNetUnfolderBase]: 593/1094 cut-off events.
[2024-06-14 15:03:12,184 INFO L125 PetriNetUnfolderBase]: For 90915/90915 co-relation queries the response was YES.
[2024-06-14 15:03:12,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6799 conditions, 1094 events. 593/1094 cut-off events. For 90915/90915 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5801 event pairs, 89 based on Foata normal form. 10/1104 useless extension candidates. Maximal degree in co-relation 6698. Up to 784 conditions per place.
[2024-06-14 15:03:12,193 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 150 selfloop transitions, 59 changer transitions 15/226 dead transitions.
[2024-06-14 15:03:12,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 226 transitions, 2483 flow
[2024-06-14 15:03:12,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:03:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:03:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions.
[2024-06-14 15:03:12,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40762463343108507
[2024-06-14 15:03:12,194 INFO L175 Difference]: Start difference. First operand has 234 places, 202 transitions, 1953 flow. Second operand 11 states and 139 transitions.
[2024-06-14 15:03:12,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 226 transitions, 2483 flow
[2024-06-14 15:03:12,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 226 transitions, 2355 flow, removed 2 selfloop flow, removed 9 redundant places.
[2024-06-14 15:03:12,323 INFO L231 Difference]: Finished difference. Result has 234 places, 197 transitions, 1885 flow
[2024-06-14 15:03:12,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1885, PETRI_PLACES=234, PETRI_TRANSITIONS=197}
[2024-06-14 15:03:12,323 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 204 predicate places.
[2024-06-14 15:03:12,323 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 197 transitions, 1885 flow
[2024-06-14 15:03:12,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:12,324 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:12,324 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:03:12,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123
[2024-06-14 15:03:12,324 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:03:12,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:12,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2066954844, now seen corresponding path program 1 times
[2024-06-14 15:03:12,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:12,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255900307]
[2024-06-14 15:03:12,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:12,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:18,550 INFO 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:03:18,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:18,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255900307]
[2024-06-14 15:03:18,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255900307] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:18,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:18,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-14 15:03:18,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375939426]
[2024-06-14 15:03:18,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:18,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-14 15:03:18,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:18,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-14 15:03:18,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2024-06-14 15:03:18,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:03:18,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 197 transitions, 1885 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:18,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:18,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:03:18,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:19,399 INFO L124 PetriNetUnfolderBase]: 569/1044 cut-off events.
[2024-06-14 15:03:19,399 INFO L125 PetriNetUnfolderBase]: For 73117/73117 co-relation queries the response was YES.
[2024-06-14 15:03:19,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6546 conditions, 1044 events. 569/1044 cut-off events. For 73117/73117 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5462 event pairs, 87 based on Foata normal form. 2/1046 useless extension candidates. Maximal degree in co-relation 6445. Up to 828 conditions per place.
[2024-06-14 15:03:19,408 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 164 selfloop transitions, 52 changer transitions 0/218 dead transitions.
[2024-06-14 15:03:19,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 218 transitions, 2371 flow
[2024-06-14 15:03:19,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-06-14 15:03:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2024-06-14 15:03:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions.
[2024-06-14 15:03:19,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.369727047146402
[2024-06-14 15:03:19,409 INFO L175 Difference]: Start difference. First operand has 234 places, 197 transitions, 1885 flow. Second operand 13 states and 149 transitions.
[2024-06-14 15:03:19,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 218 transitions, 2371 flow
[2024-06-14 15:03:19,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 218 transitions, 2236 flow, removed 5 selfloop flow, removed 9 redundant places.
[2024-06-14 15:03:19,541 INFO L231 Difference]: Finished difference. Result has 231 places, 198 transitions, 1868 flow
[2024-06-14 15:03:19,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1750, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1868, PETRI_PLACES=231, PETRI_TRANSITIONS=198}
[2024-06-14 15:03:19,541 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 201 predicate places.
[2024-06-14 15:03:19,541 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 198 transitions, 1868 flow
[2024-06-14 15:03:19,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:19,542 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:19,542 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:03:19,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124
[2024-06-14 15:03:19,542 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:03:19,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:19,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1317641304, now seen corresponding path program 18 times
[2024-06-14 15:03:19,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:19,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171355036]
[2024-06-14 15:03:19,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:19,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:03:25,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:25,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171355036]
[2024-06-14 15:03:25,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171355036] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:25,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:25,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-14 15:03:25,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730899276]
[2024-06-14 15:03:25,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:25,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-14 15:03:25,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:25,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-14 15:03:25,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2024-06-14 15:03:25,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:03:25,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 198 transitions, 1868 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:25,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:25,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:03:25,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:26,426 INFO L124 PetriNetUnfolderBase]: 585/1080 cut-off events.
[2024-06-14 15:03:26,426 INFO L125 PetriNetUnfolderBase]: For 90816/90816 co-relation queries the response was YES.
[2024-06-14 15:03:26,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6646 conditions, 1080 events. 585/1080 cut-off events. For 90816/90816 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5707 event pairs, 89 based on Foata normal form. 10/1090 useless extension candidates. Maximal degree in co-relation 6545. Up to 820 conditions per place.
[2024-06-14 15:03:26,436 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 161 selfloop transitions, 50 changer transitions 11/224 dead transitions.
[2024-06-14 15:03:26,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 224 transitions, 2394 flow
[2024-06-14 15:03:26,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2024-06-14 15:03:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2024-06-14 15:03:26,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 162 transitions.
[2024-06-14 15:03:26,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37327188940092165
[2024-06-14 15:03:26,437 INFO L175 Difference]: Start difference. First operand has 231 places, 198 transitions, 1868 flow. Second operand 14 states and 162 transitions.
[2024-06-14 15:03:26,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 224 transitions, 2394 flow
[2024-06-14 15:03:26,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 224 transitions, 2286 flow, removed 3 selfloop flow, removed 11 redundant places.
[2024-06-14 15:03:26,575 INFO L231 Difference]: Finished difference. Result has 234 places, 195 transitions, 1824 flow
[2024-06-14 15:03:26,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1760, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1824, PETRI_PLACES=234, PETRI_TRANSITIONS=195}
[2024-06-14 15:03:26,575 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 204 predicate places.
[2024-06-14 15:03:26,576 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 195 transitions, 1824 flow
[2024-06-14 15:03:26,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:26,576 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:26,576 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:03:26,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125
[2024-06-14 15:03:26,576 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:03:26,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:26,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1879872000, now seen corresponding path program 19 times
[2024-06-14 15:03:26,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:26,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089704317]
[2024-06-14 15:03:26,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:26,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:32,055 INFO 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:03:32,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:32,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089704317]
[2024-06-14 15:03:32,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089704317] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:32,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:32,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-14 15:03:32,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965378163]
[2024-06-14 15:03:32,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:32,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-14 15:03:32,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:32,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-14 15:03:32,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2024-06-14 15:03:32,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:03:32,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 195 transitions, 1824 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:32,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:32,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:03:32,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:32,954 INFO L124 PetriNetUnfolderBase]: 575/1066 cut-off events.
[2024-06-14 15:03:32,955 INFO L125 PetriNetUnfolderBase]: For 93437/93437 co-relation queries the response was YES.
[2024-06-14 15:03:32,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6563 conditions, 1066 events. 575/1066 cut-off events. For 93437/93437 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5634 event pairs, 89 based on Foata normal form. 10/1076 useless extension candidates. Maximal degree in co-relation 6461. Up to 806 conditions per place.
[2024-06-14 15:03:32,965 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 158 selfloop transitions, 48 changer transitions 11/219 dead transitions.
[2024-06-14 15:03:32,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 219 transitions, 2336 flow
[2024-06-14 15:03:32,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-06-14 15:03:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-14 15:03:32,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 146 transitions.
[2024-06-14 15:03:32,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3924731182795699
[2024-06-14 15:03:32,966 INFO L175 Difference]: Start difference. First operand has 234 places, 195 transitions, 1824 flow. Second operand 12 states and 146 transitions.
[2024-06-14 15:03:32,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 219 transitions, 2336 flow
[2024-06-14 15:03:33,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 219 transitions, 2230 flow, removed 3 selfloop flow, removed 12 redundant places.
[2024-06-14 15:03:33,114 INFO L231 Difference]: Finished difference. Result has 231 places, 192 transitions, 1778 flow
[2024-06-14 15:03:33,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1718, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1778, PETRI_PLACES=231, PETRI_TRANSITIONS=192}
[2024-06-14 15:03:33,114 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 201 predicate places.
[2024-06-14 15:03:33,114 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 192 transitions, 1778 flow
[2024-06-14 15:03:33,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:33,114 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:33,114 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:03:33,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126
[2024-06-14 15:03:33,115 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:03:33,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:33,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1033985918, now seen corresponding path program 20 times
[2024-06-14 15:03:33,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:33,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844634601]
[2024-06-14 15:03:33,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:33,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:38,739 INFO 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:03:38,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:38,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844634601]
[2024-06-14 15:03:38,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844634601] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:38,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:38,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:03:38,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018952917]
[2024-06-14 15:03:38,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:38,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:03:38,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:38,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:03:38,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:03:38,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:03:38,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 192 transitions, 1778 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:38,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:38,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:03:38,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:39,542 INFO L124 PetriNetUnfolderBase]: 590/1102 cut-off events.
[2024-06-14 15:03:39,542 INFO L125 PetriNetUnfolderBase]: For 111555/111555 co-relation queries the response was YES.
[2024-06-14 15:03:39,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7286 conditions, 1102 events. 590/1102 cut-off events. For 111555/111555 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5880 event pairs, 96 based on Foata normal form. 8/1110 useless extension candidates. Maximal degree in co-relation 7184. Up to 745 conditions per place.
[2024-06-14 15:03:39,551 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 158 selfloop transitions, 54 changer transitions 7/221 dead transitions.
[2024-06-14 15:03:39,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 221 transitions, 2456 flow
[2024-06-14 15:03:39,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:03:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:03:39,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions.
[2024-06-14 15:03:39,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252199413489736
[2024-06-14 15:03:39,552 INFO L175 Difference]: Start difference. First operand has 231 places, 192 transitions, 1778 flow. Second operand 11 states and 145 transitions.
[2024-06-14 15:03:39,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 221 transitions, 2456 flow
[2024-06-14 15:03:39,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 221 transitions, 2352 flow, removed 4 selfloop flow, removed 10 redundant places.
[2024-06-14 15:03:39,706 INFO L231 Difference]: Finished difference. Result has 229 places, 190 transitions, 1762 flow
[2024-06-14 15:03:39,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1676, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1762, PETRI_PLACES=229, PETRI_TRANSITIONS=190}
[2024-06-14 15:03:39,706 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places.
[2024-06-14 15:03:39,707 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 190 transitions, 1762 flow
[2024-06-14 15:03:39,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:39,707 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:39,707 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:03:39,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127
[2024-06-14 15:03:39,707 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:03:39,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:39,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1894054390, now seen corresponding path program 21 times
[2024-06-14 15:03:39,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:39,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437840865]
[2024-06-14 15:03:39,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:39,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:44,836 INFO 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:03:44,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:44,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437840865]
[2024-06-14 15:03:44,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437840865] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:44,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:44,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:03:44,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143935768]
[2024-06-14 15:03:44,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:44,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:03:44,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:44,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:03:44,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:03:45,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:03:45,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 190 transitions, 1762 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:45,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:45,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:03:45,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:45,554 INFO L124 PetriNetUnfolderBase]: 588/1100 cut-off events.
[2024-06-14 15:03:45,554 INFO L125 PetriNetUnfolderBase]: For 116207/116207 co-relation queries the response was YES.
[2024-06-14 15:03:45,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7283 conditions, 1100 events. 588/1100 cut-off events. For 116207/116207 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5895 event pairs, 100 based on Foata normal form. 10/1110 useless extension candidates. Maximal degree in co-relation 7181. Up to 810 conditions per place.
[2024-06-14 15:03:45,563 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 150 selfloop transitions, 51 changer transitions 12/215 dead transitions.
[2024-06-14 15:03:45,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 215 transitions, 2270 flow
[2024-06-14 15:03:45,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:03:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:03:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions.
[2024-06-14 15:03:45,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41642228739002934
[2024-06-14 15:03:45,564 INFO L175 Difference]: Start difference. First operand has 229 places, 190 transitions, 1762 flow. Second operand 11 states and 142 transitions.
[2024-06-14 15:03:45,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 215 transitions, 2270 flow
[2024-06-14 15:03:45,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 215 transitions, 2162 flow, removed 2 selfloop flow, removed 9 redundant places.
[2024-06-14 15:03:45,726 INFO L231 Difference]: Finished difference. Result has 229 places, 186 transitions, 1700 flow
[2024-06-14 15:03:45,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1654, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1700, PETRI_PLACES=229, PETRI_TRANSITIONS=186}
[2024-06-14 15:03:45,727 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places.
[2024-06-14 15:03:45,727 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 186 transitions, 1700 flow
[2024-06-14 15:03:45,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:45,727 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:45,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:03:45,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128
[2024-06-14 15:03:45,727 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:03:45,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:45,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1894227370, now seen corresponding path program 22 times
[2024-06-14 15:03:45,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:45,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545132414]
[2024-06-14 15:03:45,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:45,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:03:51,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:51,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545132414]
[2024-06-14 15:03:51,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545132414] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:51,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:51,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:03:51,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254869156]
[2024-06-14 15:03:51,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:51,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:03:51,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:51,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:03:51,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:03:51,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:03:51,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 186 transitions, 1700 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:51,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:51,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:03:51,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:51,705 INFO L124 PetriNetUnfolderBase]: 550/1026 cut-off events.
[2024-06-14 15:03:51,705 INFO L125 PetriNetUnfolderBase]: For 93323/93323 co-relation queries the response was YES.
[2024-06-14 15:03:51,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6299 conditions, 1026 events. 550/1026 cut-off events. For 93323/93323 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5427 event pairs, 91 based on Foata normal form. 10/1036 useless extension candidates. Maximal degree in co-relation 6197. Up to 767 conditions per place.
[2024-06-14 15:03:51,714 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 151 selfloop transitions, 45 changer transitions 11/209 dead transitions.
[2024-06-14 15:03:51,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 209 transitions, 2192 flow
[2024-06-14 15:03:51,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:03:51,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:03:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions.
[2024-06-14 15:03:51,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074
[2024-06-14 15:03:51,715 INFO L175 Difference]: Start difference. First operand has 229 places, 186 transitions, 1700 flow. Second operand 11 states and 136 transitions.
[2024-06-14 15:03:51,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 209 transitions, 2192 flow
[2024-06-14 15:03:51,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 209 transitions, 2080 flow, removed 5 selfloop flow, removed 9 redundant places.
[2024-06-14 15:03:51,856 INFO L231 Difference]: Finished difference. Result has 227 places, 183 transitions, 1638 flow
[2024-06-14 15:03:51,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1588, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1638, PETRI_PLACES=227, PETRI_TRANSITIONS=183}
[2024-06-14 15:03:51,857 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 197 predicate places.
[2024-06-14 15:03:51,857 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 183 transitions, 1638 flow
[2024-06-14 15:03:51,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:51,857 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:51,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 15:03:51,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129
[2024-06-14 15:03:51,857 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:03:51,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:51,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1894234314, now seen corresponding path program 2 times
[2024-06-14 15:03:51,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:51,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993206960]
[2024-06-14 15:03:51,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:51,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:57,855 INFO 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:03:57,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:57,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993206960]
[2024-06-14 15:03:57,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993206960] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:57,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:57,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:03:57,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574370496]
[2024-06-14 15:03:57,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:57,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:03:57,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:57,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:03:57,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:03:57,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:03:57,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 183 transitions, 1638 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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:03:57,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:57,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:03:57,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:58,423 INFO L124 PetriNetUnfolderBase]: 528/984 cut-off events.
[2024-06-14 15:03:58,423 INFO L125 PetriNetUnfolderBase]: For 74983/74983 co-relation queries the response was YES.
[2024-06-14 15:03:58,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6075 conditions, 984 events. 528/984 cut-off events. For 74983/74983 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5160 event pairs, 87 based on Foata normal form. 2/986 useless extension candidates. Maximal degree in co-relation 5973. Up to 769 conditions per place.
[2024-06-14 15:03:58,431 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 153 selfloop transitions, 46 changer transitions 0/201 dead transitions.
[2024-06-14 15:03:58,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 201 transitions, 2088 flow
[2024-06-14 15:03:58,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-06-14 15:03:58,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:03:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions.
[2024-06-14 15:03:58,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742
[2024-06-14 15:03:58,432 INFO L175 Difference]: Start difference. First operand has 227 places, 183 transitions, 1638 flow. Second operand 10 states and 122 transitions.
[2024-06-14 15:03:58,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 201 transitions, 2088 flow
[2024-06-14 15:03:58,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 201 transitions, 1972 flow, removed 3 selfloop flow, removed 12 redundant places.
[2024-06-14 15:03:58,576 INFO L231 Difference]: Finished difference. Result has 221 places, 184 transitions, 1630 flow
[2024-06-14 15:03:58,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1522, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1630, PETRI_PLACES=221, PETRI_TRANSITIONS=184}
[2024-06-14 15:03:58,577 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 191 predicate places.
[2024-06-14 15:03:58,577 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 184 transitions, 1630 flow
[2024-06-14 15:03:58,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 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:03:58,577 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:58,577 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:03:58,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130
[2024-06-14 15:03:58,577 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:03:58,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:58,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2060468094, now seen corresponding path program 3 times
[2024-06-14 15:03:58,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:58,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831374321]
[2024-06-14 15:03:58,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:58,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:04:04,894 INFO 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:04:04,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:04:04,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831374321]
[2024-06-14 15:04:04,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831374321] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:04:04,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:04:04,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-14 15:04:04,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907507846]
[2024-06-14 15:04:04,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:04:04,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-14 15:04:04,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:04:04,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-14 15:04:04,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2024-06-14 15:04:05,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31
[2024-06-14 15:04:05,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 184 transitions, 1630 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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:04:05,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:04:05,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31
[2024-06-14 15:04:05,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:04:05,588 INFO L124 PetriNetUnfolderBase]: 546/1022 cut-off events.
[2024-06-14 15:04:05,588 INFO L125 PetriNetUnfolderBase]: For 88073/88073 co-relation queries the response was YES.
[2024-06-14 15:04:05,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6189 conditions, 1022 events. 546/1022 cut-off events. For 88073/88073 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5381 event pairs, 90 based on Foata normal form. 8/1030 useless extension candidates. Maximal degree in co-relation 6089. Up to 766 conditions per place.
[2024-06-14 15:04:05,597 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 152 selfloop transitions, 48 changer transitions 9/211 dead transitions.
[2024-06-14 15:04:05,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 211 transitions, 2147 flow
[2024-06-14 15:04:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-06-14 15:04:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:04:05,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions.
[2024-06-14 15:04:05,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36070381231671556
[2024-06-14 15:04:05,598 INFO L175 Difference]: Start difference. First operand has 221 places, 184 transitions, 1630 flow. Second operand 11 states and 123 transitions.
[2024-06-14 15:04:05,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 211 transitions, 2147 flow
[2024-06-14 15:04:05,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 211 transitions, 2049 flow, removed 4 selfloop flow, removed 8 redundant places.
[2024-06-14 15:04:05,745 INFO L231 Difference]: Finished difference. Result has 226 places, 187 transitions, 1688 flow
[2024-06-14 15:04:05,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1532, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1688, PETRI_PLACES=226, PETRI_TRANSITIONS=187}
[2024-06-14 15:04:05,745 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 196 predicate places.
[2024-06-14 15:04:05,745 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 187 transitions, 1688 flow
[2024-06-14 15:04:05,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 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:04:05,745 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:04:05,745 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:04:05,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131
[2024-06-14 15:04:05,746 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:04:05,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:04:05,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1317395350, now seen corresponding path program 4 times
[2024-06-14 15:04:05,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:04:05,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806331815]
[2024-06-14 15:04:05,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:04:05,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:04:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:04:12,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:04:12,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:04:12,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806331815]
[2024-06-14 15:04:12,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806331815] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:04:12,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:04:12,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:04:12,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114123583]
[2024-06-14 15:04:12,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:04:12,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:04:12,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:04:12,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:04:12,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:04:13,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:04:13,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 187 transitions, 1688 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:13,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:04:13,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:04:13,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:04:13,616 INFO L124 PetriNetUnfolderBase]: 527/982 cut-off events.
[2024-06-14 15:04:13,616 INFO L125 PetriNetUnfolderBase]: For 72424/72424 co-relation queries the response was YES.
[2024-06-14 15:04:13,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6106 conditions, 982 events. 527/982 cut-off events. For 72424/72424 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5076 event pairs, 80 based on Foata normal form. 2/984 useless extension candidates. Maximal degree in co-relation 6003. Up to 752 conditions per place.
[2024-06-14 15:04:13,623 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 157 selfloop transitions, 49 changer transitions 0/208 dead transitions.
[2024-06-14 15:04:13,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 208 transitions, 2166 flow
[2024-06-14 15:04:13,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-06-14 15:04:13,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2024-06-14 15:04:13,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 146 transitions.
[2024-06-14 15:04:13,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36228287841191065
[2024-06-14 15:04:13,625 INFO L175 Difference]: Start difference. First operand has 226 places, 187 transitions, 1688 flow. Second operand 13 states and 146 transitions.
[2024-06-14 15:04:13,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 208 transitions, 2166 flow
[2024-06-14 15:04:13,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 208 transitions, 2105 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-06-14 15:04:13,752 INFO L231 Difference]: Finished difference. Result has 229 places, 188 transitions, 1743 flow
[2024-06-14 15:04:13,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1627, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1743, PETRI_PLACES=229, PETRI_TRANSITIONS=188}
[2024-06-14 15:04:13,752 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places.
[2024-06-14 15:04:13,753 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 188 transitions, 1743 flow
[2024-06-14 15:04:13,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:13,753 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:04:13,753 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:04:13,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132
[2024-06-14 15:04:13,753 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:04:13,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:04:13,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1324075044, now seen corresponding path program 23 times
[2024-06-14 15:04:13,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:04:13,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757588973]
[2024-06-14 15:04:13,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:04:13,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:04:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:04:19,039 INFO 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:04:19,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:04:19,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757588973]
[2024-06-14 15:04:19,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757588973] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:04:19,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:04:19,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-06-14 15:04:19,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289333138]
[2024-06-14 15:04:19,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:04:19,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-06-14 15:04:19,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:04:19,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-06-14 15:04:19,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132
[2024-06-14 15:04:19,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31
[2024-06-14 15:04:19,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 188 transitions, 1743 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:19,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:04:19,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31
[2024-06-14 15:04:19,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:04:19,729 INFO L124 PetriNetUnfolderBase]: 539/1010 cut-off events.
[2024-06-14 15:04:19,729 INFO L125 PetriNetUnfolderBase]: For 86838/86838 co-relation queries the response was YES.
[2024-06-14 15:04:19,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6220 conditions, 1010 events. 539/1010 cut-off events. For 86838/86838 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5283 event pairs, 78 based on Foata normal form. 8/1018 useless extension candidates. Maximal degree in co-relation 6116. Up to 668 conditions per place.
[2024-06-14 15:04:19,737 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 153 selfloop transitions, 54 changer transitions 7/216 dead transitions.
[2024-06-14 15:04:19,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 216 transitions, 2423 flow
[2024-06-14 15:04:19,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-06-14 15:04:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-14 15:04:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 150 transitions.
[2024-06-14 15:04:19,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129
[2024-06-14 15:04:19,738 INFO L175 Difference]: Start difference. First operand has 229 places, 188 transitions, 1743 flow. Second operand 12 states and 150 transitions.
[2024-06-14 15:04:19,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 216 transitions, 2423 flow
[2024-06-14 15:04:19,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 216 transitions, 2317 flow, removed 5 selfloop flow, removed 11 redundant places.
[2024-06-14 15:04:19,887 INFO L231 Difference]: Finished difference. Result has 230 places, 186 transitions, 1726 flow
[2024-06-14 15:04:19,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1637, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1726, PETRI_PLACES=230, PETRI_TRANSITIONS=186}
[2024-06-14 15:04:19,887 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 200 predicate places.
[2024-06-14 15:04:19,887 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 186 transitions, 1726 flow
[2024-06-14 15:04:19,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:19,887 INFO L200 CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:04:19,887 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:04:19,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133
[2024-06-14 15:04:19,888 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-14 15:04:19,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:04:19,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1879699020, now seen corresponding path program 24 times
[2024-06-14 15:04:19,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:04:19,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174991184]
[2024-06-14 15:04:19,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:04:19,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:04:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15