./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi004.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/rfi004.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi004.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 22:16:51,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 22:16:51,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 22:16:51,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 22:16:51,818 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 22:16:51,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 22:16:51,833 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 22:16:51,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 22:16:51,834 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 22:16:51,834 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 22:16:51,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 22:16:51,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 22:16:51,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 22:16:51,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 22:16:51,836 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 22:16:51,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 22:16:51,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 22:16:51,837 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 22:16:51,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 22:16:51,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 22:16:51,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 22:16:51,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 22:16:51,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 22:16:51,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 22:16:51,844 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 22:16:51,844 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 22:16:51,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 22:16:51,845 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 22:16:51,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 22:16:51,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 22:16:51,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 22:16:51,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 22:16:51,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:16:51,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 22:16:51,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 22:16:51,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 22:16:51,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 22:16:51,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 22:16:51,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 22:16:51,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 22:16:51,848 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 22:16:51,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 22:16:51,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 22:16:51,849 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-03 22:16:52,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 22:16:52,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 22:16:52,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 22:16:52,085 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 22:16:52,085 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 22:16:52,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004.i [2024-06-03 22:16:53,089 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 22:16:53,322 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 22:16:53,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004.i [2024-06-03 22:16:53,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70755d883/fc1776877c7a429faeb43cdd36ab159d/FLAGce1bac1cc [2024-06-03 22:16:53,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70755d883/fc1776877c7a429faeb43cdd36ab159d [2024-06-03 22:16:53,348 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 22:16:53,349 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 22:16:53,349 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/rfi004.yml/witness.yml [2024-06-03 22:16:53,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 22:16:53,493 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 22:16:53,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 22:16:53,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 22:16:53,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 22:16:53,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:16:53" (1/2) ... [2024-06-03 22:16:53,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cef0e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:16:53, skipping insertion in model container [2024-06-03 22:16:53,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:16:53" (1/2) ... [2024-06-03 22:16:53,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3eee0581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:16:53, skipping insertion in model container [2024-06-03 22:16:53,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:16:53" (2/2) ... [2024-06-03 22:16:53,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cef0e86 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:53, skipping insertion in model container [2024-06-03 22:16:53,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:16:53" (2/2) ... [2024-06-03 22:16:53,504 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 22:16:53,558 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 22:16:53,560 INFO L97 edCorrectnessWitness]: Location invariant before [L819-L819] (((((((((((((((((! multithreaded || y$r_buff1_thd0 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_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_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$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_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$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_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 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) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 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 )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__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_thd1 >= 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_thd1 >= 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 )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__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_thd1 >= 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_thd1 >= 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 )z >= 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_thd1 >= 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_thd1 >= 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 )z >= 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_thd1 >= 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_thd1 >= 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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$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$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$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$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$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_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$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_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 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$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$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 )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 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_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (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_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$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_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 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)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-03 22:16:53,560 INFO L97 edCorrectnessWitness]: Location invariant before [L818-L818] (((((((((((((((((! multithreaded || y$r_buff1_thd0 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_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_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$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_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$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_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 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) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 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 )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__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_thd1 >= 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_thd1 >= 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 )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__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_thd1 >= 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_thd1 >= 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 )z >= 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_thd1 >= 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_thd1 >= 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 )z >= 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_thd1 >= 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_thd1 >= 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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$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$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$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$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$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_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$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_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 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$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$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 )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 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_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (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_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 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_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$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_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 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)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-03 22:16:53,561 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 22:16:53,561 INFO L106 edCorrectnessWitness]: ghost_update [L816-L816] multithreaded = 1; [2024-06-03 22:16:53,596 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 22:16:53,860 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:16:53,868 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 22:16:54,099 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:16:54,143 INFO L206 MainTranslator]: Completed translation [2024-06-03 22:16:54,144 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:54 WrapperNode [2024-06-03 22:16:54,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 22:16:54,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 22:16:54,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 22:16:54,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 22:16:54,150 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 03.06 10:16:54" (1/1) ... [2024-06-03 22:16:54,181 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 03.06 10:16:54" (1/1) ... [2024-06-03 22:16:54,243 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 121 [2024-06-03 22:16:54,243 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 22:16:54,244 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 22:16:54,244 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 22:16:54,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 22:16:54,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:54" (1/1) ... [2024-06-03 22:16:54,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:54" (1/1) ... [2024-06-03 22:16:54,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:54" (1/1) ... [2024-06-03 22:16:54,306 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-03 22:16:54,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:54" (1/1) ... [2024-06-03 22:16:54,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:54" (1/1) ... [2024-06-03 22:16:54,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:54" (1/1) ... [2024-06-03 22:16:54,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:54" (1/1) ... [2024-06-03 22:16:54,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:54" (1/1) ... [2024-06-03 22:16:54,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:54" (1/1) ... [2024-06-03 22:16:54,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 22:16:54,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 22:16:54,361 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 22:16:54,361 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 22:16:54,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:54" (1/1) ... [2024-06-03 22:16:54,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:16:54,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 22:16:54,384 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-03 22:16:54,392 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-03 22:16:54,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 22:16:54,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 22:16:54,413 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 22:16:54,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 22:16:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 22:16:54,414 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 22:16:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 22:16:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 22:16:54,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 22:16:54,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 22:16:54,415 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 22:16:54,524 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 22:16:54,526 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 22:16:55,235 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 22:16:55,235 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 22:16:55,435 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 22:16:55,435 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 22:16:55,437 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:16:55 BoogieIcfgContainer [2024-06-03 22:16:55,437 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 22:16:55,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 22:16:55,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 22:16:55,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 22:16:55,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:16:53" (1/4) ... [2024-06-03 22:16:55,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f27c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:16:55, skipping insertion in model container [2024-06-03 22:16:55,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:16:53" (2/4) ... [2024-06-03 22:16:55,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f27c2e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:16:55, skipping insertion in model container [2024-06-03 22:16:55,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:16:54" (3/4) ... [2024-06-03 22:16:55,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f27c2e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:16:55, skipping insertion in model container [2024-06-03 22:16:55,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:16:55" (4/4) ... [2024-06-03 22:16:55,449 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004.i [2024-06-03 22:16:55,463 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 22:16:55,463 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-03 22:16:55,463 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 22:16:55,541 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 22:16:55,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 74 flow [2024-06-03 22:16:55,614 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-06-03 22:16:55,614 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:16:55,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 22:16:55,616 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 33 transitions, 74 flow [2024-06-03 22:16:55,618 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 56 flow [2024-06-03 22:16:55,634 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 22:16:55,640 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;@17ce3456, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 22:16:55,640 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-03 22:16:55,647 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 22:16:55,647 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 22:16:55,647 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:16:55,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:16:55,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 22:16:55,649 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-03 22:16:55,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:16:55,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1590784768, now seen corresponding path program 1 times [2024-06-03 22:16:55,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:16:55,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248386550] [2024-06-03 22:16:55,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:16:55,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:16:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:00,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:00,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:00,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248386550] [2024-06-03 22:17:00,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248386550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:00,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:00,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 22:17:00,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780072678] [2024-06-03 22:17:00,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:00,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 22:17:00,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:00,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 22:17:00,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 22:17:00,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2024-06-03 22:17:00,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-03 22:17:00,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:00,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2024-06-03 22:17:00,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:00,630 INFO L124 PetriNetUnfolderBase]: 131/270 cut-off events. [2024-06-03 22:17:00,630 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-03 22:17:00,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 270 events. 131/270 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1073 event pairs, 75 based on Foata normal form. 1/257 useless extension candidates. Maximal degree in co-relation 514. Up to 235 conditions per place. [2024-06-03 22:17:00,636 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 22 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-06-03 22:17:00,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 121 flow [2024-06-03 22:17:00,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 22:17:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 22:17:00,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-06-03 22:17:00,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-06-03 22:17:00,648 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 56 flow. Second operand 3 states and 60 transitions. [2024-06-03 22:17:00,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 121 flow [2024-06-03 22:17:00,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 22:17:00,652 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 75 flow [2024-06-03 22:17:00,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2024-06-03 22:17:00,658 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2024-06-03 22:17:00,658 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 75 flow [2024-06-03 22:17:00,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-03 22:17:00,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:00,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:00,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 22:17:00,659 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-03 22:17:00,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:00,660 INFO L85 PathProgramCache]: Analyzing trace with hash -263456755, now seen corresponding path program 1 times [2024-06-03 22:17:00,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:00,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33673255] [2024-06-03 22:17:00,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:00,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:03,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:03,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33673255] [2024-06-03 22:17:03,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33673255] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:03,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:03,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 22:17:03,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446144276] [2024-06-03 22:17:03,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:03,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 22:17:03,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:03,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 22:17:03,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 22:17:03,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-03 22:17:03,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:03,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:03,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-03 22:17:03,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:04,015 INFO L124 PetriNetUnfolderBase]: 150/299 cut-off events. [2024-06-03 22:17:04,015 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-06-03 22:17:04,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 299 events. 150/299 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1188 event pairs, 68 based on Foata normal form. 2/297 useless extension candidates. Maximal degree in co-relation 654. Up to 258 conditions per place. [2024-06-03 22:17:04,018 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 27 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2024-06-03 22:17:04,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 165 flow [2024-06-03 22:17:04,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 22:17:04,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 22:17:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2024-06-03 22:17:04,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-06-03 22:17:04,020 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 75 flow. Second operand 4 states and 74 transitions. [2024-06-03 22:17:04,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 165 flow [2024-06-03 22:17:04,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 162 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 22:17:04,021 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 99 flow [2024-06-03 22:17:04,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2024-06-03 22:17:04,022 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2024-06-03 22:17:04,022 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 99 flow [2024-06-03 22:17:04,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:04,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:04,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:04,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 22:17:04,023 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-03 22:17:04,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:04,024 INFO L85 PathProgramCache]: Analyzing trace with hash -471492034, now seen corresponding path program 1 times [2024-06-03 22:17:04,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:04,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344214126] [2024-06-03 22:17:04,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:04,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:08,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:08,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344214126] [2024-06-03 22:17:08,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344214126] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:08,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:08,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 22:17:08,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204920950] [2024-06-03 22:17:08,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:08,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 22:17:08,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:08,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 22:17:08,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 22:17:08,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-03 22:17:08,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:08,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:08,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-03 22:17:08,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:08,589 INFO L124 PetriNetUnfolderBase]: 147/293 cut-off events. [2024-06-03 22:17:08,590 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2024-06-03 22:17:08,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 293 events. 147/293 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1145 event pairs, 47 based on Foata normal form. 2/290 useless extension candidates. Maximal degree in co-relation 714. Up to 244 conditions per place. [2024-06-03 22:17:08,594 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 31 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-03 22:17:08,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 213 flow [2024-06-03 22:17:08,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:17:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:17:08,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-06-03 22:17:08,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-06-03 22:17:08,598 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 99 flow. Second operand 5 states and 90 transitions. [2024-06-03 22:17:08,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 213 flow [2024-06-03 22:17:08,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 204 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-03 22:17:08,601 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 123 flow [2024-06-03 22:17:08,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-06-03 22:17:08,602 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2024-06-03 22:17:08,602 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 123 flow [2024-06-03 22:17:08,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:08,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:08,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:08,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 22:17:08,604 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:17:08,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:08,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1918731910, now seen corresponding path program 1 times [2024-06-03 22:17:08,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:08,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006062742] [2024-06-03 22:17:08,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:08,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:14,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:14,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006062742] [2024-06-03 22:17:14,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006062742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:14,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:14,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:17:14,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270249663] [2024-06-03 22:17:14,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:14,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:17:14,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:14,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:17:14,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:17:14,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-03 22:17:14,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:14,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:14,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-03 22:17:14,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:14,922 INFO L124 PetriNetUnfolderBase]: 123/265 cut-off events. [2024-06-03 22:17:14,923 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2024-06-03 22:17:14,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 265 events. 123/265 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1036 event pairs, 38 based on Foata normal form. 1/261 useless extension candidates. Maximal degree in co-relation 693. Up to 219 conditions per place. [2024-06-03 22:17:14,925 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 26 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2024-06-03 22:17:14,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 205 flow [2024-06-03 22:17:14,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:17:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:17:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2024-06-03 22:17:14,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2024-06-03 22:17:14,926 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 123 flow. Second operand 5 states and 79 transitions. [2024-06-03 22:17:14,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 205 flow [2024-06-03 22:17:14,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 190 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 22:17:14,928 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 135 flow [2024-06-03 22:17:14,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2024-06-03 22:17:14,930 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2024-06-03 22:17:14,930 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 135 flow [2024-06-03 22:17:14,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:14,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:14,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:14,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 22:17:14,931 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-03 22:17:14,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:14,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2132256803, now seen corresponding path program 1 times [2024-06-03 22:17:14,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:14,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142018315] [2024-06-03 22:17:14,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:14,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:18,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:18,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:18,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142018315] [2024-06-03 22:17:18,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142018315] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:18,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:18,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:17:18,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003105702] [2024-06-03 22:17:18,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:18,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:17:18,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:18,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:17:18,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:17:18,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-03 22:17:18,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:18,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:18,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-03 22:17:18,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:19,250 INFO L124 PetriNetUnfolderBase]: 141/280 cut-off events. [2024-06-03 22:17:19,250 INFO L125 PetriNetUnfolderBase]: For 410/410 co-relation queries the response was YES. [2024-06-03 22:17:19,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 280 events. 141/280 cut-off events. For 410/410 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1052 event pairs, 24 based on Foata normal form. 4/282 useless extension candidates. Maximal degree in co-relation 794. Up to 215 conditions per place. [2024-06-03 22:17:19,252 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 33 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2024-06-03 22:17:19,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 243 flow [2024-06-03 22:17:19,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:17:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:17:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-03 22:17:19,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51010101010101 [2024-06-03 22:17:19,254 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 135 flow. Second operand 6 states and 101 transitions. [2024-06-03 22:17:19,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 243 flow [2024-06-03 22:17:19,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 232 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-03 22:17:19,256 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 136 flow [2024-06-03 22:17:19,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2024-06-03 22:17:19,257 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2024-06-03 22:17:19,257 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 136 flow [2024-06-03 22:17:19,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:19,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:19,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:19,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 22:17:19,258 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-03 22:17:19,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:19,258 INFO L85 PathProgramCache]: Analyzing trace with hash 648853829, now seen corresponding path program 1 times [2024-06-03 22:17:19,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:19,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861493653] [2024-06-03 22:17:19,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:19,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:25,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:25,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:25,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861493653] [2024-06-03 22:17:25,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861493653] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:25,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:25,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:17:25,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001180490] [2024-06-03 22:17:25,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:25,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:17:25,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:25,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:17:25,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:17:25,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 22:17:25,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 136 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:25,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:25,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 22:17:25,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:25,515 INFO L124 PetriNetUnfolderBase]: 139/281 cut-off events. [2024-06-03 22:17:25,515 INFO L125 PetriNetUnfolderBase]: For 560/560 co-relation queries the response was YES. [2024-06-03 22:17:25,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 281 events. 139/281 cut-off events. For 560/560 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1091 event pairs, 41 based on Foata normal form. 1/280 useless extension candidates. Maximal degree in co-relation 832. Up to 242 conditions per place. [2024-06-03 22:17:25,517 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 27 selfloop transitions, 8 changer transitions 0/40 dead transitions. [2024-06-03 22:17:25,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 228 flow [2024-06-03 22:17:25,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:17:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:17:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2024-06-03 22:17:25,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2024-06-03 22:17:25,519 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 136 flow. Second operand 6 states and 86 transitions. [2024-06-03 22:17:25,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 228 flow [2024-06-03 22:17:25,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 208 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-03 22:17:25,522 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 149 flow [2024-06-03 22:17:25,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-06-03 22:17:25,523 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2024-06-03 22:17:25,523 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 149 flow [2024-06-03 22:17:25,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:25,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:25,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:25,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 22:17:25,524 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-03 22:17:25,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:25,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1367042023, now seen corresponding path program 1 times [2024-06-03 22:17:25,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:25,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327646675] [2024-06-03 22:17:25,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:25,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:31,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:31,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327646675] [2024-06-03 22:17:31,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327646675] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:31,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:31,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:17:31,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518317264] [2024-06-03 22:17:31,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:31,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:17:31,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:31,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:17:31,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:17:31,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 22:17:31,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 149 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:31,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:31,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 22:17:31,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:31,625 INFO L124 PetriNetUnfolderBase]: 156/307 cut-off events. [2024-06-03 22:17:31,625 INFO L125 PetriNetUnfolderBase]: For 861/861 co-relation queries the response was YES. [2024-06-03 22:17:31,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 307 events. 156/307 cut-off events. For 861/861 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1212 event pairs, 46 based on Foata normal form. 2/307 useless extension candidates. Maximal degree in co-relation 968. Up to 255 conditions per place. [2024-06-03 22:17:31,627 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 32 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2024-06-03 22:17:31,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 263 flow [2024-06-03 22:17:31,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:17:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:17:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2024-06-03 22:17:31,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-03 22:17:31,630 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 149 flow. Second operand 6 states and 90 transitions. [2024-06-03 22:17:31,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 263 flow [2024-06-03 22:17:31,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 246 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 22:17:31,634 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 165 flow [2024-06-03 22:17:31,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2024-06-03 22:17:31,635 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2024-06-03 22:17:31,635 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 165 flow [2024-06-03 22:17:31,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:31,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:31,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:31,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 22:17:31,636 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-03 22:17:31,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:31,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1360375783, now seen corresponding path program 2 times [2024-06-03 22:17:31,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:31,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110930777] [2024-06-03 22:17:31,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:31,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:37,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:37,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:37,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110930777] [2024-06-03 22:17:37,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110930777] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:37,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:37,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:17:37,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462173675] [2024-06-03 22:17:37,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:37,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:17:37,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:37,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:17:37,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:17:38,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 22:17:38,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 165 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:38,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:38,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 22:17:38,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:38,311 INFO L124 PetriNetUnfolderBase]: 155/309 cut-off events. [2024-06-03 22:17:38,312 INFO L125 PetriNetUnfolderBase]: For 1122/1122 co-relation queries the response was YES. [2024-06-03 22:17:38,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 309 events. 155/309 cut-off events. For 1122/1122 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1226 event pairs, 45 based on Foata normal form. 2/309 useless extension candidates. Maximal degree in co-relation 1039. Up to 246 conditions per place. [2024-06-03 22:17:38,314 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 32 selfloop transitions, 12 changer transitions 0/50 dead transitions. [2024-06-03 22:17:38,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 297 flow [2024-06-03 22:17:38,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:17:38,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:17:38,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2024-06-03 22:17:38,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45021645021645024 [2024-06-03 22:17:38,315 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 165 flow. Second operand 7 states and 104 transitions. [2024-06-03 22:17:38,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 297 flow [2024-06-03 22:17:38,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 280 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 22:17:38,317 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 193 flow [2024-06-03 22:17:38,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=193, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-06-03 22:17:38,318 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2024-06-03 22:17:38,318 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 193 flow [2024-06-03 22:17:38,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:38,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:38,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:38,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 22:17:38,319 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-03 22:17:38,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:38,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1360366855, now seen corresponding path program 1 times [2024-06-03 22:17:38,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:38,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434131717] [2024-06-03 22:17:38,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:38,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:44,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:44,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434131717] [2024-06-03 22:17:44,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434131717] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:44,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:44,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:17:44,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689295571] [2024-06-03 22:17:44,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:44,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:17:44,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:44,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:17:44,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:17:44,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 22:17:44,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 193 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:44,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:44,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 22:17:44,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:44,790 INFO L124 PetriNetUnfolderBase]: 144/292 cut-off events. [2024-06-03 22:17:44,791 INFO L125 PetriNetUnfolderBase]: For 1122/1122 co-relation queries the response was YES. [2024-06-03 22:17:44,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 292 events. 144/292 cut-off events. For 1122/1122 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1130 event pairs, 39 based on Foata normal form. 1/291 useless extension candidates. Maximal degree in co-relation 1019. Up to 248 conditions per place. [2024-06-03 22:17:44,793 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 32 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2024-06-03 22:17:44,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 303 flow [2024-06-03 22:17:44,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:17:44,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:17:44,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-03 22:17:44,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-03 22:17:44,795 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 193 flow. Second operand 7 states and 98 transitions. [2024-06-03 22:17:44,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 303 flow [2024-06-03 22:17:44,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 47 transitions, 274 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 22:17:44,798 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 203 flow [2024-06-03 22:17:44,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2024-06-03 22:17:44,799 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2024-06-03 22:17:44,799 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 203 flow [2024-06-03 22:17:44,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:44,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:44,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:44,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 22:17:44,800 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-03 22:17:44,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:44,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1130930954, now seen corresponding path program 1 times [2024-06-03 22:17:44,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:44,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547855696] [2024-06-03 22:17:44,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:44,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:50,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:50,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:50,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547855696] [2024-06-03 22:17:50,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547855696] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:50,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:50,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:17:50,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934678105] [2024-06-03 22:17:50,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:50,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:17:50,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:50,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:17:50,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:17:51,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:17:51,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 203 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:51,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:51,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:17:51,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:51,366 INFO L124 PetriNetUnfolderBase]: 170/328 cut-off events. [2024-06-03 22:17:51,367 INFO L125 PetriNetUnfolderBase]: For 1546/1546 co-relation queries the response was YES. [2024-06-03 22:17:51,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 328 events. 170/328 cut-off events. For 1546/1546 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1298 event pairs, 45 based on Foata normal form. 2/328 useless extension candidates. Maximal degree in co-relation 1199. Up to 278 conditions per place. [2024-06-03 22:17:51,369 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 40 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2024-06-03 22:17:51,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 347 flow [2024-06-03 22:17:51,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:17:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:17:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-03 22:17:51,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4199134199134199 [2024-06-03 22:17:51,370 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 203 flow. Second operand 7 states and 97 transitions. [2024-06-03 22:17:51,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 347 flow [2024-06-03 22:17:51,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 54 transitions, 324 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 22:17:51,372 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 221 flow [2024-06-03 22:17:51,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=221, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-06-03 22:17:51,373 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2024-06-03 22:17:51,373 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 221 flow [2024-06-03 22:17:51,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:51,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:51,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:51,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 22:17:51,374 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-03 22:17:51,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:51,374 INFO L85 PathProgramCache]: Analyzing trace with hash 778291492, now seen corresponding path program 2 times [2024-06-03 22:17:51,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:51,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654596963] [2024-06-03 22:17:51,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:51,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:17:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:17:57,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:17:57,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654596963] [2024-06-03 22:17:57,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654596963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:17:57,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:17:57,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:17:57,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584015623] [2024-06-03 22:17:57,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:17:57,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:17:57,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:17:57,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:17:57,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:17:57,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:17:57,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 221 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:57,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:17:57,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:17:57,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:17:58,123 INFO L124 PetriNetUnfolderBase]: 181/348 cut-off events. [2024-06-03 22:17:58,123 INFO L125 PetriNetUnfolderBase]: For 1968/1968 co-relation queries the response was YES. [2024-06-03 22:17:58,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 348 events. 181/348 cut-off events. For 1968/1968 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1407 event pairs, 45 based on Foata normal form. 2/348 useless extension candidates. Maximal degree in co-relation 1347. Up to 267 conditions per place. [2024-06-03 22:17:58,125 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 38 selfloop transitions, 19 changer transitions 0/61 dead transitions. [2024-06-03 22:17:58,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 427 flow [2024-06-03 22:17:58,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:17:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:17:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2024-06-03 22:17:58,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-03 22:17:58,127 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 221 flow. Second operand 8 states and 112 transitions. [2024-06-03 22:17:58,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 61 transitions, 427 flow [2024-06-03 22:17:58,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 61 transitions, 402 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 22:17:58,130 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 275 flow [2024-06-03 22:17:58,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=275, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-06-03 22:17:58,131 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 25 predicate places. [2024-06-03 22:17:58,131 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 275 flow [2024-06-03 22:17:58,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:17:58,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:17:58,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:17:58,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 22:17:58,131 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-03 22:17:58,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:17:58,132 INFO L85 PathProgramCache]: Analyzing trace with hash 778024582, now seen corresponding path program 3 times [2024-06-03 22:17:58,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:17:58,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807898938] [2024-06-03 22:17:58,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:17:58,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:17:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:18:04,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:04,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807898938] [2024-06-03 22:18:04,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807898938] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:04,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:04,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:18:04,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744130750] [2024-06-03 22:18:04,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:04,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:18:04,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:04,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:18:04,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:18:04,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:18:04,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 275 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:04,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:04,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:18:04,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:04,460 INFO L124 PetriNetUnfolderBase]: 179/349 cut-off events. [2024-06-03 22:18:04,460 INFO L125 PetriNetUnfolderBase]: For 2357/2357 co-relation queries the response was YES. [2024-06-03 22:18:04,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 349 events. 179/349 cut-off events. For 2357/2357 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1421 event pairs, 45 based on Foata normal form. 1/348 useless extension candidates. Maximal degree in co-relation 1418. Up to 286 conditions per place. [2024-06-03 22:18:04,463 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 45 selfloop transitions, 16 changer transitions 0/65 dead transitions. [2024-06-03 22:18:04,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 65 transitions, 472 flow [2024-06-03 22:18:04,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:18:04,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:18:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-03 22:18:04,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4128787878787879 [2024-06-03 22:18:04,465 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 275 flow. Second operand 8 states and 109 transitions. [2024-06-03 22:18:04,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 65 transitions, 472 flow [2024-06-03 22:18:04,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 65 transitions, 439 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-03 22:18:04,470 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 343 flow [2024-06-03 22:18:04,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=343, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2024-06-03 22:18:04,472 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 31 predicate places. [2024-06-03 22:18:04,472 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 343 flow [2024-06-03 22:18:04,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:04,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:04,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:18:04,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 22:18:04,473 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-03 22:18:04,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:04,473 INFO L85 PathProgramCache]: Analyzing trace with hash 527868600, now seen corresponding path program 1 times [2024-06-03 22:18:04,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:04,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055437966] [2024-06-03 22:18:04,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:04,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:18:10,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:10,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055437966] [2024-06-03 22:18:10,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055437966] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:10,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:10,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:18:10,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092641379] [2024-06-03 22:18:10,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:10,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:18:10,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:10,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:18:10,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:18:11,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 22:18:11,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 343 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:11,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:11,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 22:18:11,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:11,431 INFO L124 PetriNetUnfolderBase]: 169/338 cut-off events. [2024-06-03 22:18:11,431 INFO L125 PetriNetUnfolderBase]: For 2675/2675 co-relation queries the response was YES. [2024-06-03 22:18:11,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 338 events. 169/338 cut-off events. For 2675/2675 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1409 event pairs, 43 based on Foata normal form. 1/337 useless extension candidates. Maximal degree in co-relation 1443. Up to 260 conditions per place. [2024-06-03 22:18:11,433 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 46 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2024-06-03 22:18:11,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 507 flow [2024-06-03 22:18:11,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:18:11,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:18:11,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2024-06-03 22:18:11,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45021645021645024 [2024-06-03 22:18:11,434 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 343 flow. Second operand 7 states and 104 transitions. [2024-06-03 22:18:11,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 507 flow [2024-06-03 22:18:11,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 489 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-03 22:18:11,437 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 374 flow [2024-06-03 22:18:11,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=374, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-06-03 22:18:11,438 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 35 predicate places. [2024-06-03 22:18:11,438 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 374 flow [2024-06-03 22:18:11,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:11,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:11,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:18:11,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 22:18:11,439 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-03 22:18:11,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:11,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1878941958, now seen corresponding path program 1 times [2024-06-03 22:18:11,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:11,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401978004] [2024-06-03 22:18:11,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:11,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:17,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:18:17,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:17,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401978004] [2024-06-03 22:18:17,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401978004] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:17,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:17,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:18:17,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575338223] [2024-06-03 22:18:17,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:17,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:18:17,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:17,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:18:17,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:18:17,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:18:17,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 374 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:17,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:17,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:18:17,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:18,070 INFO L124 PetriNetUnfolderBase]: 183/354 cut-off events. [2024-06-03 22:18:18,070 INFO L125 PetriNetUnfolderBase]: For 3093/3093 co-relation queries the response was YES. [2024-06-03 22:18:18,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1613 conditions, 354 events. 183/354 cut-off events. For 3093/3093 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1442 event pairs, 43 based on Foata normal form. 2/354 useless extension candidates. Maximal degree in co-relation 1580. Up to 292 conditions per place. [2024-06-03 22:18:18,072 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 53 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2024-06-03 22:18:18,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 559 flow [2024-06-03 22:18:18,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:18:18,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:18:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-03 22:18:18,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4128787878787879 [2024-06-03 22:18:18,074 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 374 flow. Second operand 8 states and 109 transitions. [2024-06-03 22:18:18,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 559 flow [2024-06-03 22:18:18,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 70 transitions, 526 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-03 22:18:18,077 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 393 flow [2024-06-03 22:18:18,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=393, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2024-06-03 22:18:18,078 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2024-06-03 22:18:18,078 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 393 flow [2024-06-03 22:18:18,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:18,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:18,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:18:18,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 22:18:18,079 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-03 22:18:18,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:18,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1651040808, now seen corresponding path program 2 times [2024-06-03 22:18:18,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:18,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812977373] [2024-06-03 22:18:18,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:18,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:18:24,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:24,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812977373] [2024-06-03 22:18:24,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812977373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:24,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:24,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:18:24,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908650505] [2024-06-03 22:18:24,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:24,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:18:24,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:24,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:18:24,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:18:24,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:18:24,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 393 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:24,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:24,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:18:24,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:25,031 INFO L124 PetriNetUnfolderBase]: 195/376 cut-off events. [2024-06-03 22:18:25,031 INFO L125 PetriNetUnfolderBase]: For 3800/3800 co-relation queries the response was YES. [2024-06-03 22:18:25,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1784 conditions, 376 events. 195/376 cut-off events. For 3800/3800 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1577 event pairs, 45 based on Foata normal form. 2/376 useless extension candidates. Maximal degree in co-relation 1750. Up to 260 conditions per place. [2024-06-03 22:18:25,034 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 51 selfloop transitions, 25 changer transitions 0/80 dead transitions. [2024-06-03 22:18:25,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 80 transitions, 699 flow [2024-06-03 22:18:25,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:18:25,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:18:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2024-06-03 22:18:25,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43097643097643096 [2024-06-03 22:18:25,035 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 393 flow. Second operand 9 states and 128 transitions. [2024-06-03 22:18:25,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 80 transitions, 699 flow [2024-06-03 22:18:25,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 80 transitions, 665 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-03 22:18:25,040 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 479 flow [2024-06-03 22:18:25,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=479, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2024-06-03 22:18:25,041 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 42 predicate places. [2024-06-03 22:18:25,041 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 479 flow [2024-06-03 22:18:25,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:25,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:25,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:18:25,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 22:18:25,042 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-03 22:18:25,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:25,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1642766598, now seen corresponding path program 3 times [2024-06-03 22:18:25,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:25,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536361902] [2024-06-03 22:18:25,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:25,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:31,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:18:31,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:31,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536361902] [2024-06-03 22:18:31,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536361902] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:31,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:31,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:18:31,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543429179] [2024-06-03 22:18:31,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:31,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:18:31,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:31,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:18:31,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:18:31,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:18:31,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 479 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:31,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:31,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:18:31,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:31,820 INFO L124 PetriNetUnfolderBase]: 201/392 cut-off events. [2024-06-03 22:18:31,820 INFO L125 PetriNetUnfolderBase]: For 4583/4583 co-relation queries the response was YES. [2024-06-03 22:18:31,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1950 conditions, 392 events. 201/392 cut-off events. For 4583/4583 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1669 event pairs, 44 based on Foata normal form. 2/392 useless extension candidates. Maximal degree in co-relation 1914. Up to 266 conditions per place. [2024-06-03 22:18:31,823 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 52 selfloop transitions, 28 changer transitions 0/84 dead transitions. [2024-06-03 22:18:31,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 84 transitions, 783 flow [2024-06-03 22:18:31,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:18:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:18:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2024-06-03 22:18:31,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4276094276094276 [2024-06-03 22:18:31,824 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 479 flow. Second operand 9 states and 127 transitions. [2024-06-03 22:18:31,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 84 transitions, 783 flow [2024-06-03 22:18:31,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 84 transitions, 747 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-03 22:18:31,829 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 529 flow [2024-06-03 22:18:31,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=529, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2024-06-03 22:18:31,829 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 47 predicate places. [2024-06-03 22:18:31,830 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 529 flow [2024-06-03 22:18:31,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:31,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:31,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:18:31,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 22:18:31,830 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-03 22:18:31,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:31,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1642469928, now seen corresponding path program 4 times [2024-06-03 22:18:31,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:31,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634252473] [2024-06-03 22:18:31,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:31,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:38,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:18:38,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:38,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634252473] [2024-06-03 22:18:38,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634252473] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:38,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:38,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:18:38,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342619548] [2024-06-03 22:18:38,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:38,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:18:38,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:38,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:18:38,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:18:38,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:18:38,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 65 transitions, 529 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:38,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:38,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:18:38,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:38,658 INFO L124 PetriNetUnfolderBase]: 197/386 cut-off events. [2024-06-03 22:18:38,658 INFO L125 PetriNetUnfolderBase]: For 4836/4836 co-relation queries the response was YES. [2024-06-03 22:18:38,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1960 conditions, 386 events. 197/386 cut-off events. For 4836/4836 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1639 event pairs, 43 based on Foata normal form. 2/386 useless extension candidates. Maximal degree in co-relation 1922. Up to 263 conditions per place. [2024-06-03 22:18:38,661 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 46 selfloop transitions, 32 changer transitions 0/82 dead transitions. [2024-06-03 22:18:38,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 82 transitions, 769 flow [2024-06-03 22:18:38,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:18:38,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:18:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2024-06-03 22:18:38,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4208754208754209 [2024-06-03 22:18:38,663 INFO L175 Difference]: Start difference. First operand has 79 places, 65 transitions, 529 flow. Second operand 9 states and 125 transitions. [2024-06-03 22:18:38,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 82 transitions, 769 flow [2024-06-03 22:18:38,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 82 transitions, 696 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-03 22:18:38,668 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 525 flow [2024-06-03 22:18:38,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=525, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2024-06-03 22:18:38,668 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 50 predicate places. [2024-06-03 22:18:38,669 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 525 flow [2024-06-03 22:18:38,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:38,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:38,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:18:38,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 22:18:38,669 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-03 22:18:38,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:38,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1642459016, now seen corresponding path program 1 times [2024-06-03 22:18:38,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:38,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9155466] [2024-06-03 22:18:38,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:38,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:18:45,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:45,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9155466] [2024-06-03 22:18:45,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9155466] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:45,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:45,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:18:45,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199855865] [2024-06-03 22:18:45,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:45,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:18:45,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:45,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:18:45,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:18:45,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:18:45,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 525 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:45,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:45,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:18:45,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:45,819 INFO L124 PetriNetUnfolderBase]: 195/381 cut-off events. [2024-06-03 22:18:45,819 INFO L125 PetriNetUnfolderBase]: For 4900/4900 co-relation queries the response was YES. [2024-06-03 22:18:45,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1953 conditions, 381 events. 195/381 cut-off events. For 4900/4900 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1610 event pairs, 44 based on Foata normal form. 1/380 useless extension candidates. Maximal degree in co-relation 1914. Up to 329 conditions per place. [2024-06-03 22:18:45,822 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 58 selfloop transitions, 14 changer transitions 0/76 dead transitions. [2024-06-03 22:18:45,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 76 transitions, 701 flow [2024-06-03 22:18:45,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:18:45,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:18:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-03 22:18:45,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2024-06-03 22:18:45,823 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 525 flow. Second operand 9 states and 114 transitions. [2024-06-03 22:18:45,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 76 transitions, 701 flow [2024-06-03 22:18:45,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 76 transitions, 646 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-03 22:18:45,828 INFO L231 Difference]: Finished difference. Result has 84 places, 67 transitions, 519 flow [2024-06-03 22:18:45,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=519, PETRI_PLACES=84, PETRI_TRANSITIONS=67} [2024-06-03 22:18:45,828 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 52 predicate places. [2024-06-03 22:18:45,828 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 67 transitions, 519 flow [2024-06-03 22:18:45,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:45,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:45,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:18:45,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 22:18:45,829 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-03 22:18:45,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:45,830 INFO L85 PathProgramCache]: Analyzing trace with hash -815941689, now seen corresponding path program 1 times [2024-06-03 22:18:45,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:45,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224390658] [2024-06-03 22:18:45,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:45,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:52,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:18:52,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:52,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224390658] [2024-06-03 22:18:52,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224390658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:52,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:52,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:18:52,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229001358] [2024-06-03 22:18:52,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:52,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:18:52,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:52,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:18:52,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:18:52,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:18:52,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 67 transitions, 519 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:52,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:52,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:18:52,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:52,580 INFO L124 PetriNetUnfolderBase]: 193/378 cut-off events. [2024-06-03 22:18:52,581 INFO L125 PetriNetUnfolderBase]: For 4963/4963 co-relation queries the response was YES. [2024-06-03 22:18:52,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1926 conditions, 378 events. 193/378 cut-off events. For 4963/4963 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1596 event pairs, 43 based on Foata normal form. 1/377 useless extension candidates. Maximal degree in co-relation 1886. Up to 317 conditions per place. [2024-06-03 22:18:52,583 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 67 selfloop transitions, 12 changer transitions 0/83 dead transitions. [2024-06-03 22:18:52,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 83 transitions, 737 flow [2024-06-03 22:18:52,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:18:52,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:18:52,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-03 22:18:52,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4128787878787879 [2024-06-03 22:18:52,586 INFO L175 Difference]: Start difference. First operand has 84 places, 67 transitions, 519 flow. Second operand 8 states and 109 transitions. [2024-06-03 22:18:52,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 83 transitions, 737 flow [2024-06-03 22:18:52,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 83 transitions, 654 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-03 22:18:52,590 INFO L231 Difference]: Finished difference. Result has 82 places, 69 transitions, 495 flow [2024-06-03 22:18:52,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=495, PETRI_PLACES=82, PETRI_TRANSITIONS=69} [2024-06-03 22:18:52,591 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 50 predicate places. [2024-06-03 22:18:52,591 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 69 transitions, 495 flow [2024-06-03 22:18:52,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:52,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:52,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:18:52,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 22:18:52,592 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-03 22:18:52,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:52,592 INFO L85 PathProgramCache]: Analyzing trace with hash -197891243, now seen corresponding path program 1 times [2024-06-03 22:18:52,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:52,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729520476] [2024-06-03 22:18:52,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:52,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:18:58,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-03 22:18:58,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:18:58,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729520476] [2024-06-03 22:18:58,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729520476] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:18:58,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:18:58,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:18:58,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618918264] [2024-06-03 22:18:58,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:18:58,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:18:58,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:18:58,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:18:58,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:18:58,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:18:58,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 69 transitions, 495 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:58,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:18:58,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:18:58,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:18:59,210 INFO L124 PetriNetUnfolderBase]: 241/465 cut-off events. [2024-06-03 22:18:59,210 INFO L125 PetriNetUnfolderBase]: For 6089/6089 co-relation queries the response was YES. [2024-06-03 22:18:59,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2342 conditions, 465 events. 241/465 cut-off events. For 6089/6089 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2113 event pairs, 40 based on Foata normal form. 2/463 useless extension candidates. Maximal degree in co-relation 2302. Up to 358 conditions per place. [2024-06-03 22:18:59,214 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 76 selfloop transitions, 27 changer transitions 0/107 dead transitions. [2024-06-03 22:18:59,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 107 transitions, 1001 flow [2024-06-03 22:18:59,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:18:59,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:18:59,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-03 22:18:59,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-03 22:18:59,216 INFO L175 Difference]: Start difference. First operand has 82 places, 69 transitions, 495 flow. Second operand 10 states and 133 transitions. [2024-06-03 22:18:59,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 107 transitions, 1001 flow [2024-06-03 22:18:59,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 107 transitions, 915 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-03 22:18:59,222 INFO L231 Difference]: Finished difference. Result has 91 places, 92 transitions, 743 flow [2024-06-03 22:18:59,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=743, PETRI_PLACES=91, PETRI_TRANSITIONS=92} [2024-06-03 22:18:59,222 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 59 predicate places. [2024-06-03 22:18:59,222 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 92 transitions, 743 flow [2024-06-03 22:18:59,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:18:59,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:18:59,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:18:59,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 22:18:59,223 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-03 22:18:59,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:18:59,224 INFO L85 PathProgramCache]: Analyzing trace with hash 180863589, now seen corresponding path program 2 times [2024-06-03 22:18:59,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:18:59,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853604466] [2024-06-03 22:18:59,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:18:59,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:18:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:05,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-03 22:19:05,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:05,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853604466] [2024-06-03 22:19:05,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853604466] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:05,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:05,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:19:05,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528233251] [2024-06-03 22:19:05,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:05,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:19:05,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:05,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:19:05,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:19:05,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:19:05,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 743 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:05,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:05,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:19:05,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:06,003 INFO L124 PetriNetUnfolderBase]: 247/476 cut-off events. [2024-06-03 22:19:06,003 INFO L125 PetriNetUnfolderBase]: For 6671/6671 co-relation queries the response was YES. [2024-06-03 22:19:06,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2535 conditions, 476 events. 247/476 cut-off events. For 6671/6671 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2158 event pairs, 30 based on Foata normal form. 2/476 useless extension candidates. Maximal degree in co-relation 2489. Up to 391 conditions per place. [2024-06-03 22:19:06,007 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 88 selfloop transitions, 20 changer transitions 0/112 dead transitions. [2024-06-03 22:19:06,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 112 transitions, 1056 flow [2024-06-03 22:19:06,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:19:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:19:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-03 22:19:06,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-03 22:19:06,008 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 743 flow. Second operand 10 states and 133 transitions. [2024-06-03 22:19:06,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 112 transitions, 1056 flow [2024-06-03 22:19:06,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1032 flow, removed 11 selfloop flow, removed 1 redundant places. [2024-06-03 22:19:06,017 INFO L231 Difference]: Finished difference. Result has 101 places, 96 transitions, 821 flow [2024-06-03 22:19:06,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=821, PETRI_PLACES=101, PETRI_TRANSITIONS=96} [2024-06-03 22:19:06,017 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 69 predicate places. [2024-06-03 22:19:06,018 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 96 transitions, 821 flow [2024-06-03 22:19:06,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:06,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:06,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:19:06,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 22:19:06,018 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-03 22:19:06,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:06,019 INFO L85 PathProgramCache]: Analyzing trace with hash 357335525, now seen corresponding path program 2 times [2024-06-03 22:19:06,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:06,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746934591] [2024-06-03 22:19:06,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:06,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:12,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:12,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746934591] [2024-06-03 22:19:12,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746934591] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:12,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:12,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:19:12,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852118541] [2024-06-03 22:19:12,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:12,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:19:12,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:12,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:19:12,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:19:12,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:19:12,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 821 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:12,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:12,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:19:12,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:13,018 INFO L124 PetriNetUnfolderBase]: 250/479 cut-off events. [2024-06-03 22:19:13,018 INFO L125 PetriNetUnfolderBase]: For 7461/7461 co-relation queries the response was YES. [2024-06-03 22:19:13,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2647 conditions, 479 events. 250/479 cut-off events. For 7461/7461 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2172 event pairs, 40 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 2597. Up to 370 conditions per place. [2024-06-03 22:19:13,021 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 71 selfloop transitions, 31 changer transitions 0/106 dead transitions. [2024-06-03 22:19:13,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 106 transitions, 1110 flow [2024-06-03 22:19:13,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:19:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:19:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2024-06-03 22:19:13,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2024-06-03 22:19:13,022 INFO L175 Difference]: Start difference. First operand has 101 places, 96 transitions, 821 flow. Second operand 8 states and 111 transitions. [2024-06-03 22:19:13,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 106 transitions, 1110 flow [2024-06-03 22:19:13,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 106 transitions, 1046 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-03 22:19:13,030 INFO L231 Difference]: Finished difference. Result has 105 places, 98 transitions, 849 flow [2024-06-03 22:19:13,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=849, PETRI_PLACES=105, PETRI_TRANSITIONS=98} [2024-06-03 22:19:13,031 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 73 predicate places. [2024-06-03 22:19:13,031 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 98 transitions, 849 flow [2024-06-03 22:19:13,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:13,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:13,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:19:13,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 22:19:13,032 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-03 22:19:13,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:13,032 INFO L85 PathProgramCache]: Analyzing trace with hash 357128135, now seen corresponding path program 3 times [2024-06-03 22:19:13,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:13,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791541731] [2024-06-03 22:19:13,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:13,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:19,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:19,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791541731] [2024-06-03 22:19:19,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791541731] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:19,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:19,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:19:19,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918293983] [2024-06-03 22:19:19,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:19,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:19:19,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:19,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:19:19,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:19:19,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:19:19,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 98 transitions, 849 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:19,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:19,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:19:19,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:20,318 INFO L124 PetriNetUnfolderBase]: 247/476 cut-off events. [2024-06-03 22:19:20,318 INFO L125 PetriNetUnfolderBase]: For 7768/7768 co-relation queries the response was YES. [2024-06-03 22:19:20,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2616 conditions, 476 events. 247/476 cut-off events. For 7768/7768 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2173 event pairs, 40 based on Foata normal form. 1/471 useless extension candidates. Maximal degree in co-relation 2565. Up to 366 conditions per place. [2024-06-03 22:19:20,322 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 70 selfloop transitions, 31 changer transitions 0/105 dead transitions. [2024-06-03 22:19:20,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 105 transitions, 1067 flow [2024-06-03 22:19:20,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:19:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:19:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-03 22:19:20,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4128787878787879 [2024-06-03 22:19:20,324 INFO L175 Difference]: Start difference. First operand has 105 places, 98 transitions, 849 flow. Second operand 8 states and 109 transitions. [2024-06-03 22:19:20,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 105 transitions, 1067 flow [2024-06-03 22:19:20,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 105 transitions, 981 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-03 22:19:20,332 INFO L231 Difference]: Finished difference. Result has 107 places, 98 transitions, 830 flow [2024-06-03 22:19:20,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=830, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2024-06-03 22:19:20,333 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 75 predicate places. [2024-06-03 22:19:20,333 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 830 flow [2024-06-03 22:19:20,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:20,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:20,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:19:20,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 22:19:20,334 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-03 22:19:20,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:20,334 INFO L85 PathProgramCache]: Analyzing trace with hash -830128041, now seen corresponding path program 3 times [2024-06-03 22:19:20,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:20,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091024162] [2024-06-03 22:19:20,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:20,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:27,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:27,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:27,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091024162] [2024-06-03 22:19:27,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091024162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:27,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:27,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:19:27,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006202233] [2024-06-03 22:19:27,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:27,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:19:27,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:27,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:19:27,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:19:27,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:19:27,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 830 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:27,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:27,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:19:27,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:27,504 INFO L124 PetriNetUnfolderBase]: 271/521 cut-off events. [2024-06-03 22:19:27,505 INFO L125 PetriNetUnfolderBase]: For 9490/9490 co-relation queries the response was YES. [2024-06-03 22:19:27,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2923 conditions, 521 events. 271/521 cut-off events. For 9490/9490 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2411 event pairs, 32 based on Foata normal form. 2/521 useless extension candidates. Maximal degree in co-relation 2871. Up to 311 conditions per place. [2024-06-03 22:19:27,509 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 76 selfloop transitions, 45 changer transitions 0/125 dead transitions. [2024-06-03 22:19:27,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 125 transitions, 1336 flow [2024-06-03 22:19:27,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:19:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:19:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2024-06-03 22:19:27,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42727272727272725 [2024-06-03 22:19:27,511 INFO L175 Difference]: Start difference. First operand has 107 places, 98 transitions, 830 flow. Second operand 10 states and 141 transitions. [2024-06-03 22:19:27,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 125 transitions, 1336 flow [2024-06-03 22:19:27,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 125 transitions, 1266 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-03 22:19:27,527 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 993 flow [2024-06-03 22:19:27,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=993, PETRI_PLACES=111, PETRI_TRANSITIONS=106} [2024-06-03 22:19:27,528 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 79 predicate places. [2024-06-03 22:19:27,528 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 993 flow [2024-06-03 22:19:27,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:27,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:27,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:19:27,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 22:19:27,528 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-03 22:19:27,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:27,529 INFO L85 PathProgramCache]: Analyzing trace with hash -571254171, now seen corresponding path program 4 times [2024-06-03 22:19:27,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:27,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674342434] [2024-06-03 22:19:27,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:27,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:34,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:34,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674342434] [2024-06-03 22:19:34,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674342434] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:34,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:34,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:19:34,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994909860] [2024-06-03 22:19:34,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:34,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:19:34,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:34,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:19:34,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:19:34,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:19:34,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 993 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:34,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:34,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:19:34,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:34,859 INFO L124 PetriNetUnfolderBase]: 277/530 cut-off events. [2024-06-03 22:19:34,859 INFO L125 PetriNetUnfolderBase]: For 10727/10727 co-relation queries the response was YES. [2024-06-03 22:19:34,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3134 conditions, 530 events. 277/530 cut-off events. For 10727/10727 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2465 event pairs, 52 based on Foata normal form. 2/530 useless extension candidates. Maximal degree in co-relation 3081. Up to 463 conditions per place. [2024-06-03 22:19:34,864 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 98 selfloop transitions, 15 changer transitions 0/117 dead transitions. [2024-06-03 22:19:34,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 117 transitions, 1279 flow [2024-06-03 22:19:34,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:19:34,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:19:34,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-03 22:19:34,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3872053872053872 [2024-06-03 22:19:34,871 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 993 flow. Second operand 9 states and 115 transitions. [2024-06-03 22:19:34,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 117 transitions, 1279 flow [2024-06-03 22:19:34,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 117 transitions, 1219 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-03 22:19:34,885 INFO L231 Difference]: Finished difference. Result has 115 places, 108 transitions, 1008 flow [2024-06-03 22:19:34,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=935, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1008, PETRI_PLACES=115, PETRI_TRANSITIONS=108} [2024-06-03 22:19:34,885 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 83 predicate places. [2024-06-03 22:19:34,885 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 108 transitions, 1008 flow [2024-06-03 22:19:34,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:34,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:34,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:19:34,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 22:19:34,886 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-03 22:19:34,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:34,886 INFO L85 PathProgramCache]: Analyzing trace with hash 623040741, now seen corresponding path program 5 times [2024-06-03 22:19:34,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:34,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864577489] [2024-06-03 22:19:34,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:34,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:41,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:41,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:41,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864577489] [2024-06-03 22:19:41,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864577489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:41,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:41,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:19:41,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140638092] [2024-06-03 22:19:41,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:41,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:19:41,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:41,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:19:41,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:19:41,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:19:41,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 108 transitions, 1008 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:41,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:41,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:19:41,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:42,068 INFO L124 PetriNetUnfolderBase]: 273/525 cut-off events. [2024-06-03 22:19:42,068 INFO L125 PetriNetUnfolderBase]: For 10456/10456 co-relation queries the response was YES. [2024-06-03 22:19:42,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3070 conditions, 525 events. 273/525 cut-off events. For 10456/10456 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2444 event pairs, 37 based on Foata normal form. 2/525 useless extension candidates. Maximal degree in co-relation 3015. Up to 314 conditions per place. [2024-06-03 22:19:42,074 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 67 selfloop transitions, 54 changer transitions 0/125 dead transitions. [2024-06-03 22:19:42,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 125 transitions, 1356 flow [2024-06-03 22:19:42,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:19:42,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:19:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2024-06-03 22:19:42,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212121212121212 [2024-06-03 22:19:42,075 INFO L175 Difference]: Start difference. First operand has 115 places, 108 transitions, 1008 flow. Second operand 10 states and 139 transitions. [2024-06-03 22:19:42,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 125 transitions, 1356 flow [2024-06-03 22:19:42,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 125 transitions, 1281 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-03 22:19:42,090 INFO L231 Difference]: Finished difference. Result has 118 places, 108 transitions, 1046 flow [2024-06-03 22:19:42,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1046, PETRI_PLACES=118, PETRI_TRANSITIONS=108} [2024-06-03 22:19:42,091 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 86 predicate places. [2024-06-03 22:19:42,091 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 108 transitions, 1046 flow [2024-06-03 22:19:42,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:42,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:42,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:19:42,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 22:19:42,092 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-03 22:19:42,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:42,092 INFO L85 PathProgramCache]: Analyzing trace with hash 357343461, now seen corresponding path program 6 times [2024-06-03 22:19:42,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:42,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012126055] [2024-06-03 22:19:42,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:42,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:48,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-03 22:19:48,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:48,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012126055] [2024-06-03 22:19:48,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012126055] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:48,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:48,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:19:48,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371107464] [2024-06-03 22:19:48,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:48,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:19:48,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:48,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:19:48,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:19:48,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:19:48,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 108 transitions, 1046 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:48,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:48,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:19:48,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:49,185 INFO L124 PetriNetUnfolderBase]: 269/519 cut-off events. [2024-06-03 22:19:49,185 INFO L125 PetriNetUnfolderBase]: For 10554/10554 co-relation queries the response was YES. [2024-06-03 22:19:49,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3053 conditions, 519 events. 269/519 cut-off events. For 10554/10554 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2429 event pairs, 34 based on Foata normal form. 2/519 useless extension candidates. Maximal degree in co-relation 2997. Up to 311 conditions per place. [2024-06-03 22:19:49,190 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 73 selfloop transitions, 46 changer transitions 0/123 dead transitions. [2024-06-03 22:19:49,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 123 transitions, 1334 flow [2024-06-03 22:19:49,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:19:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:19:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2024-06-03 22:19:49,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-03 22:19:49,191 INFO L175 Difference]: Start difference. First operand has 118 places, 108 transitions, 1046 flow. Second operand 10 states and 140 transitions. [2024-06-03 22:19:49,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 123 transitions, 1334 flow [2024-06-03 22:19:49,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 123 transitions, 1221 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-03 22:19:49,206 INFO L231 Difference]: Finished difference. Result has 120 places, 108 transitions, 1030 flow [2024-06-03 22:19:49,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1030, PETRI_PLACES=120, PETRI_TRANSITIONS=108} [2024-06-03 22:19:49,207 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 88 predicate places. [2024-06-03 22:19:49,207 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 108 transitions, 1030 flow [2024-06-03 22:19:49,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:49,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:49,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:19:49,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 22:19:49,208 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-03 22:19:49,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:49,208 INFO L85 PathProgramCache]: Analyzing trace with hash 623379075, now seen corresponding path program 1 times [2024-06-03 22:19:49,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:49,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029134359] [2024-06-03 22:19:49,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:49,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:56,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:56,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029134359] [2024-06-03 22:19:56,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029134359] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:56,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:56,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:19:56,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467925415] [2024-06-03 22:19:56,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:56,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:19:56,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:56,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:19:56,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:19:56,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:19:56,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 108 transitions, 1030 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:56,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:56,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:19:56,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:57,065 INFO L124 PetriNetUnfolderBase]: 266/513 cut-off events. [2024-06-03 22:19:57,066 INFO L125 PetriNetUnfolderBase]: For 10678/10678 co-relation queries the response was YES. [2024-06-03 22:19:57,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2984 conditions, 513 events. 266/513 cut-off events. For 10678/10678 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2381 event pairs, 49 based on Foata normal form. 2/513 useless extension candidates. Maximal degree in co-relation 2927. Up to 443 conditions per place. [2024-06-03 22:19:57,070 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 98 selfloop transitions, 16 changer transitions 0/118 dead transitions. [2024-06-03 22:19:57,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 118 transitions, 1280 flow [2024-06-03 22:19:57,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:19:57,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:19:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 22:19:57,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-03 22:19:57,071 INFO L175 Difference]: Start difference. First operand has 120 places, 108 transitions, 1030 flow. Second operand 10 states and 124 transitions. [2024-06-03 22:19:57,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 118 transitions, 1280 flow [2024-06-03 22:19:57,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 118 transitions, 1195 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-03 22:19:57,086 INFO L231 Difference]: Finished difference. Result has 123 places, 108 transitions, 981 flow [2024-06-03 22:19:57,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=945, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=981, PETRI_PLACES=123, PETRI_TRANSITIONS=108} [2024-06-03 22:19:57,087 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 91 predicate places. [2024-06-03 22:19:57,087 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 108 transitions, 981 flow [2024-06-03 22:19:57,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:57,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:57,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:19:57,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 22:19:57,088 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-03 22:19:57,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:57,088 INFO L85 PathProgramCache]: Analyzing trace with hash 756537687, now seen corresponding path program 1 times [2024-06-03 22:19:57,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:57,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126471347] [2024-06-03 22:19:57,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:57,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:03,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:03,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:03,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126471347] [2024-06-03 22:20:03,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126471347] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:03,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:03,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:20:03,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232398816] [2024-06-03 22:20:03,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:03,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:20:03,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:03,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:20:03,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:20:04,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 22:20:04,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 108 transitions, 981 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:04,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:04,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 22:20:04,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:04,393 INFO L124 PetriNetUnfolderBase]: 259/515 cut-off events. [2024-06-03 22:20:04,393 INFO L125 PetriNetUnfolderBase]: For 11137/11137 co-relation queries the response was YES. [2024-06-03 22:20:04,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2907 conditions, 515 events. 259/515 cut-off events. For 11137/11137 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2444 event pairs, 42 based on Foata normal form. 2/515 useless extension candidates. Maximal degree in co-relation 2849. Up to 402 conditions per place. [2024-06-03 22:20:04,397 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 87 selfloop transitions, 18 changer transitions 0/122 dead transitions. [2024-06-03 22:20:04,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 122 transitions, 1252 flow [2024-06-03 22:20:04,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:20:04,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:20:04,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-03 22:20:04,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42803030303030304 [2024-06-03 22:20:04,398 INFO L175 Difference]: Start difference. First operand has 123 places, 108 transitions, 981 flow. Second operand 8 states and 113 transitions. [2024-06-03 22:20:04,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 122 transitions, 1252 flow [2024-06-03 22:20:04,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 122 transitions, 1212 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-03 22:20:04,413 INFO L231 Difference]: Finished difference. Result has 124 places, 112 transitions, 1028 flow [2024-06-03 22:20:04,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1028, PETRI_PLACES=124, PETRI_TRANSITIONS=112} [2024-06-03 22:20:04,414 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 92 predicate places. [2024-06-03 22:20:04,414 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 112 transitions, 1028 flow [2024-06-03 22:20:04,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:04,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:04,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:20:04,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 22:20:04,415 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-03 22:20:04,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:04,415 INFO L85 PathProgramCache]: Analyzing trace with hash 475607383, now seen corresponding path program 2 times [2024-06-03 22:20:04,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:04,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853394641] [2024-06-03 22:20:04,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:04,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:10,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:10,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853394641] [2024-06-03 22:20:10,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853394641] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:10,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:10,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:20:10,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880916993] [2024-06-03 22:20:10,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:10,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:20:10,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:10,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:20:10,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:20:10,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 22:20:10,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 112 transitions, 1028 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:10,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:10,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 22:20:10,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:11,025 INFO L124 PetriNetUnfolderBase]: 259/511 cut-off events. [2024-06-03 22:20:11,026 INFO L125 PetriNetUnfolderBase]: For 11752/11752 co-relation queries the response was YES. [2024-06-03 22:20:11,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2962 conditions, 511 events. 259/511 cut-off events. For 11752/11752 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2438 event pairs, 34 based on Foata normal form. 2/508 useless extension candidates. Maximal degree in co-relation 2902. Up to 392 conditions per place. [2024-06-03 22:20:11,030 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 88 selfloop transitions, 21 changer transitions 0/126 dead transitions. [2024-06-03 22:20:11,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 126 transitions, 1292 flow [2024-06-03 22:20:11,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:20:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:20:11,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-03 22:20:11,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-03 22:20:11,032 INFO L175 Difference]: Start difference. First operand has 124 places, 112 transitions, 1028 flow. Second operand 8 states and 116 transitions. [2024-06-03 22:20:11,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 126 transitions, 1292 flow [2024-06-03 22:20:11,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 126 transitions, 1253 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 22:20:11,051 INFO L231 Difference]: Finished difference. Result has 127 places, 113 transitions, 1050 flow [2024-06-03 22:20:11,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1050, PETRI_PLACES=127, PETRI_TRANSITIONS=113} [2024-06-03 22:20:11,051 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 95 predicate places. [2024-06-03 22:20:11,051 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 113 transitions, 1050 flow [2024-06-03 22:20:11,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:11,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:11,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:20:11,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 22:20:11,052 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-03 22:20:11,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:11,052 INFO L85 PathProgramCache]: Analyzing trace with hash 472750423, now seen corresponding path program 3 times [2024-06-03 22:20:11,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:11,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622024550] [2024-06-03 22:20:11,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:11,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:17,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:17,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622024550] [2024-06-03 22:20:17,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622024550] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:17,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:17,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:20:17,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401731104] [2024-06-03 22:20:17,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:17,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:20:17,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:17,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:20:17,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:20:18,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 22:20:18,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 113 transitions, 1050 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:18,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:18,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 22:20:18,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:18,357 INFO L124 PetriNetUnfolderBase]: 263/519 cut-off events. [2024-06-03 22:20:18,357 INFO L125 PetriNetUnfolderBase]: For 12548/12548 co-relation queries the response was YES. [2024-06-03 22:20:18,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 519 events. 263/519 cut-off events. For 12548/12548 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2469 event pairs, 32 based on Foata normal form. 2/516 useless extension candidates. Maximal degree in co-relation 2976. Up to 384 conditions per place. [2024-06-03 22:20:18,361 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 93 selfloop transitions, 18 changer transitions 0/128 dead transitions. [2024-06-03 22:20:18,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 128 transitions, 1322 flow [2024-06-03 22:20:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:20:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:20:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2024-06-03 22:20:18,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4356060606060606 [2024-06-03 22:20:18,362 INFO L175 Difference]: Start difference. First operand has 127 places, 113 transitions, 1050 flow. Second operand 8 states and 115 transitions. [2024-06-03 22:20:18,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 128 transitions, 1322 flow [2024-06-03 22:20:18,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 128 transitions, 1273 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-03 22:20:18,381 INFO L231 Difference]: Finished difference. Result has 129 places, 114 transitions, 1057 flow [2024-06-03 22:20:18,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1057, PETRI_PLACES=129, PETRI_TRANSITIONS=114} [2024-06-03 22:20:18,382 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 97 predicate places. [2024-06-03 22:20:18,382 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 114 transitions, 1057 flow [2024-06-03 22:20:18,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:18,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:18,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:20:18,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 22:20:18,382 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-03 22:20:18,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:18,383 INFO L85 PathProgramCache]: Analyzing trace with hash 475612343, now seen corresponding path program 1 times [2024-06-03 22:20:18,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:18,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372705480] [2024-06-03 22:20:18,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:18,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:24,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:24,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372705480] [2024-06-03 22:20:24,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372705480] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:24,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:24,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:20:24,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335374026] [2024-06-03 22:20:24,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:24,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:20:24,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:24,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:20:24,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:20:25,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:20:25,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 114 transitions, 1057 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:25,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:25,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:20:25,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:25,347 INFO L124 PetriNetUnfolderBase]: 273/528 cut-off events. [2024-06-03 22:20:25,347 INFO L125 PetriNetUnfolderBase]: For 12093/12093 co-relation queries the response was YES. [2024-06-03 22:20:25,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3008 conditions, 528 events. 273/528 cut-off events. For 12093/12093 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2482 event pairs, 36 based on Foata normal form. 2/528 useless extension candidates. Maximal degree in co-relation 2946. Up to 433 conditions per place. [2024-06-03 22:20:25,351 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 97 selfloop transitions, 28 changer transitions 0/129 dead transitions. [2024-06-03 22:20:25,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 129 transitions, 1375 flow [2024-06-03 22:20:25,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:20:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:20:25,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-03 22:20:25,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2024-06-03 22:20:25,353 INFO L175 Difference]: Start difference. First operand has 129 places, 114 transitions, 1057 flow. Second operand 9 states and 120 transitions. [2024-06-03 22:20:25,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 129 transitions, 1375 flow [2024-06-03 22:20:25,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 129 transitions, 1317 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-03 22:20:25,370 INFO L231 Difference]: Finished difference. Result has 132 places, 116 transitions, 1101 flow [2024-06-03 22:20:25,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1101, PETRI_PLACES=132, PETRI_TRANSITIONS=116} [2024-06-03 22:20:25,371 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 100 predicate places. [2024-06-03 22:20:25,372 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 116 transitions, 1101 flow [2024-06-03 22:20:25,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:25,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:25,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-03 22:20:25,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 22:20:25,372 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-03 22:20:25,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:25,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2026913163, now seen corresponding path program 1 times [2024-06-03 22:20:25,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:25,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738664429] [2024-06-03 22:20:25,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:25,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:31,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:31,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:31,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738664429] [2024-06-03 22:20:31,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738664429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:31,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:31,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:20:31,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759657892] [2024-06-03 22:20:31,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:31,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:20:31,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:31,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:20:31,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:20:32,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:20:32,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 116 transitions, 1101 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:32,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:32,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:20:32,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:32,466 INFO L124 PetriNetUnfolderBase]: 276/535 cut-off events. [2024-06-03 22:20:32,466 INFO L125 PetriNetUnfolderBase]: For 12600/12600 co-relation queries the response was YES. [2024-06-03 22:20:32,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3058 conditions, 535 events. 276/535 cut-off events. For 12600/12600 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2504 event pairs, 36 based on Foata normal form. 1/534 useless extension candidates. Maximal degree in co-relation 2995. Up to 445 conditions per place. [2024-06-03 22:20:32,471 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 107 selfloop transitions, 24 changer transitions 0/135 dead transitions. [2024-06-03 22:20:32,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 135 transitions, 1447 flow [2024-06-03 22:20:32,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:20:32,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:20:32,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-03 22:20:32,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2024-06-03 22:20:32,472 INFO L175 Difference]: Start difference. First operand has 132 places, 116 transitions, 1101 flow. Second operand 10 states and 128 transitions. [2024-06-03 22:20:32,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 135 transitions, 1447 flow [2024-06-03 22:20:32,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 135 transitions, 1363 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-03 22:20:32,494 INFO L231 Difference]: Finished difference. Result has 137 places, 124 transitions, 1151 flow [2024-06-03 22:20:32,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1151, PETRI_PLACES=137, PETRI_TRANSITIONS=124} [2024-06-03 22:20:32,494 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 105 predicate places. [2024-06-03 22:20:32,494 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 124 transitions, 1151 flow [2024-06-03 22:20:32,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:32,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:32,494 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:20:32,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 22:20:32,495 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-03 22:20:32,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:32,495 INFO L85 PathProgramCache]: Analyzing trace with hash 707686665, now seen corresponding path program 4 times [2024-06-03 22:20:32,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:32,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946957487] [2024-06-03 22:20:32,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:32,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:39,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:39,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946957487] [2024-06-03 22:20:39,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946957487] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:39,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:39,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:20:39,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222939302] [2024-06-03 22:20:39,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:39,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:20:39,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:39,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:20:39,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:20:39,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 22:20:39,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 124 transitions, 1151 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:39,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:39,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 22:20:39,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:39,397 INFO L124 PetriNetUnfolderBase]: 262/517 cut-off events. [2024-06-03 22:20:39,397 INFO L125 PetriNetUnfolderBase]: For 12550/12550 co-relation queries the response was YES. [2024-06-03 22:20:39,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2960 conditions, 517 events. 262/517 cut-off events. For 12550/12550 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2475 event pairs, 35 based on Foata normal form. 2/513 useless extension candidates. Maximal degree in co-relation 2894. Up to 403 conditions per place. [2024-06-03 22:20:39,401 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 95 selfloop transitions, 21 changer transitions 0/133 dead transitions. [2024-06-03 22:20:39,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 133 transitions, 1406 flow [2024-06-03 22:20:39,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:20:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:20:39,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-03 22:20:39,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42803030303030304 [2024-06-03 22:20:39,402 INFO L175 Difference]: Start difference. First operand has 137 places, 124 transitions, 1151 flow. Second operand 8 states and 113 transitions. [2024-06-03 22:20:39,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 133 transitions, 1406 flow [2024-06-03 22:20:39,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 133 transitions, 1357 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-03 22:20:39,425 INFO L231 Difference]: Finished difference. Result has 140 places, 125 transitions, 1158 flow [2024-06-03 22:20:39,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1158, PETRI_PLACES=140, PETRI_TRANSITIONS=125} [2024-06-03 22:20:39,426 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 108 predicate places. [2024-06-03 22:20:39,426 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 125 transitions, 1158 flow [2024-06-03 22:20:39,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:39,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:39,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:20:39,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 22:20:39,426 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-03 22:20:39,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:39,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1807253609, now seen corresponding path program 2 times [2024-06-03 22:20:39,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:39,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190277023] [2024-06-03 22:20:39,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:39,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:46,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:46,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190277023] [2024-06-03 22:20:46,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190277023] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:46,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:46,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:20:46,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038188131] [2024-06-03 22:20:46,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:46,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:20:46,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:46,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:20:46,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:20:46,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:20:46,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 125 transitions, 1158 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:46,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:46,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:20:46,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:46,811 INFO L124 PetriNetUnfolderBase]: 276/547 cut-off events. [2024-06-03 22:20:46,811 INFO L125 PetriNetUnfolderBase]: For 13097/13097 co-relation queries the response was YES. [2024-06-03 22:20:46,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3076 conditions, 547 events. 276/547 cut-off events. For 13097/13097 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2622 event pairs, 26 based on Foata normal form. 1/546 useless extension candidates. Maximal degree in co-relation 3008. Up to 405 conditions per place. [2024-06-03 22:20:46,814 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 109 selfloop transitions, 36 changer transitions 0/149 dead transitions. [2024-06-03 22:20:46,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 149 transitions, 1559 flow [2024-06-03 22:20:46,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:20:46,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:20:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-03 22:20:46,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-03 22:20:46,815 INFO L175 Difference]: Start difference. First operand has 140 places, 125 transitions, 1158 flow. Second operand 11 states and 146 transitions. [2024-06-03 22:20:46,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 149 transitions, 1559 flow [2024-06-03 22:20:46,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 149 transitions, 1487 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-03 22:20:46,842 INFO L231 Difference]: Finished difference. Result has 148 places, 135 transitions, 1263 flow [2024-06-03 22:20:46,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1263, PETRI_PLACES=148, PETRI_TRANSITIONS=135} [2024-06-03 22:20:46,842 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 116 predicate places. [2024-06-03 22:20:46,843 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 135 transitions, 1263 flow [2024-06-03 22:20:46,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:46,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:46,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:20:46,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 22:20:46,843 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-03 22:20:46,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:46,843 INFO L85 PathProgramCache]: Analyzing trace with hash 2134394775, now seen corresponding path program 3 times [2024-06-03 22:20:46,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:46,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621113204] [2024-06-03 22:20:46,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:46,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:53,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:53,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:53,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621113204] [2024-06-03 22:20:53,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621113204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:53,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:53,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:20:53,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161385758] [2024-06-03 22:20:53,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:53,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:20:53,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:53,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:20:53,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:20:53,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:20:53,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 135 transitions, 1263 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:53,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:53,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:20:53,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:54,066 INFO L124 PetriNetUnfolderBase]: 279/542 cut-off events. [2024-06-03 22:20:54,067 INFO L125 PetriNetUnfolderBase]: For 13380/13380 co-relation queries the response was YES. [2024-06-03 22:20:54,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3183 conditions, 542 events. 279/542 cut-off events. For 13380/13380 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2553 event pairs, 31 based on Foata normal form. 1/541 useless extension candidates. Maximal degree in co-relation 3111. Up to 410 conditions per place. [2024-06-03 22:20:54,070 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 106 selfloop transitions, 43 changer transitions 0/153 dead transitions. [2024-06-03 22:20:54,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 153 transitions, 1643 flow [2024-06-03 22:20:54,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:20:54,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:20:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-03 22:20:54,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39669421487603307 [2024-06-03 22:20:54,073 INFO L175 Difference]: Start difference. First operand has 148 places, 135 transitions, 1263 flow. Second operand 11 states and 144 transitions. [2024-06-03 22:20:54,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 153 transitions, 1643 flow [2024-06-03 22:20:54,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 153 transitions, 1575 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-03 22:20:54,096 INFO L231 Difference]: Finished difference. Result has 155 places, 140 transitions, 1344 flow [2024-06-03 22:20:54,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1344, PETRI_PLACES=155, PETRI_TRANSITIONS=140} [2024-06-03 22:20:54,096 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 123 predicate places. [2024-06-03 22:20:54,096 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 140 transitions, 1344 flow [2024-06-03 22:20:54,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:54,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:54,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:20:54,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 22:20:54,097 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-03 22:20:54,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2144514105, now seen corresponding path program 4 times [2024-06-03 22:20:54,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:54,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549357907] [2024-06-03 22:20:54,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:54,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:01,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-03 22:21:01,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:01,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549357907] [2024-06-03 22:21:01,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549357907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:01,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:01,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:21:01,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116774607] [2024-06-03 22:21:01,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:01,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:21:01,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:01,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:21:01,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:21:02,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:21:02,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 140 transitions, 1344 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:02,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:02,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:21:02,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:02,307 INFO L124 PetriNetUnfolderBase]: 285/557 cut-off events. [2024-06-03 22:21:02,307 INFO L125 PetriNetUnfolderBase]: For 15122/15122 co-relation queries the response was YES. [2024-06-03 22:21:02,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3346 conditions, 557 events. 285/557 cut-off events. For 15122/15122 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2677 event pairs, 39 based on Foata normal form. 2/557 useless extension candidates. Maximal degree in co-relation 3271. Up to 476 conditions per place. [2024-06-03 22:21:02,311 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 130 selfloop transitions, 19 changer transitions 0/153 dead transitions. [2024-06-03 22:21:02,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 153 transitions, 1720 flow [2024-06-03 22:21:02,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:21:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:21:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-03 22:21:02,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38484848484848483 [2024-06-03 22:21:02,312 INFO L175 Difference]: Start difference. First operand has 155 places, 140 transitions, 1344 flow. Second operand 10 states and 127 transitions. [2024-06-03 22:21:02,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 153 transitions, 1720 flow [2024-06-03 22:21:02,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 153 transitions, 1634 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-03 22:21:02,339 INFO L231 Difference]: Finished difference. Result has 158 places, 143 transitions, 1360 flow [2024-06-03 22:21:02,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1261, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1360, PETRI_PLACES=158, PETRI_TRANSITIONS=143} [2024-06-03 22:21:02,339 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 126 predicate places. [2024-06-03 22:21:02,339 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 143 transitions, 1360 flow [2024-06-03 22:21:02,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:02,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:02,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:02,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 22:21:02,340 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-03 22:21:02,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:02,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2144870295, now seen corresponding path program 5 times [2024-06-03 22:21:02,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:02,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334886379] [2024-06-03 22:21:02,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:02,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:09,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:09,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334886379] [2024-06-03 22:21:09,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334886379] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:09,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:09,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:21:09,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391035411] [2024-06-03 22:21:09,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:09,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:21:09,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:09,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:21:09,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:21:10,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:21:10,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 143 transitions, 1360 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:10,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:10,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:21:10,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:10,384 INFO L124 PetriNetUnfolderBase]: 288/558 cut-off events. [2024-06-03 22:21:10,384 INFO L125 PetriNetUnfolderBase]: For 14861/14861 co-relation queries the response was YES. [2024-06-03 22:21:10,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3337 conditions, 558 events. 288/558 cut-off events. For 14861/14861 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2629 event pairs, 47 based on Foata normal form. 1/557 useless extension candidates. Maximal degree in co-relation 3263. Up to 475 conditions per place. [2024-06-03 22:21:10,388 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 129 selfloop transitions, 23 changer transitions 0/156 dead transitions. [2024-06-03 22:21:10,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 156 transitions, 1717 flow [2024-06-03 22:21:10,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:21:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:21:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-03 22:21:10,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38016528925619836 [2024-06-03 22:21:10,396 INFO L175 Difference]: Start difference. First operand has 158 places, 143 transitions, 1360 flow. Second operand 11 states and 138 transitions. [2024-06-03 22:21:10,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 156 transitions, 1717 flow [2024-06-03 22:21:10,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 156 transitions, 1642 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-03 22:21:10,427 INFO L231 Difference]: Finished difference. Result has 161 places, 145 transitions, 1369 flow [2024-06-03 22:21:10,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1285, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1369, PETRI_PLACES=161, PETRI_TRANSITIONS=145} [2024-06-03 22:21:10,428 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 129 predicate places. [2024-06-03 22:21:10,428 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 145 transitions, 1369 flow [2024-06-03 22:21:10,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:10,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:10,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:10,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 22:21:10,428 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-03 22:21:10,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:10,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1849294905, now seen corresponding path program 6 times [2024-06-03 22:21:10,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:10,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011610083] [2024-06-03 22:21:10,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:10,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:17,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-03 22:21:17,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:17,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011610083] [2024-06-03 22:21:17,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011610083] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:17,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:17,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:21:17,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076238485] [2024-06-03 22:21:17,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:17,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:21:17,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:17,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:21:17,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:21:17,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:21:17,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 145 transitions, 1369 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:17,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:17,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:21:17,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:17,744 INFO L124 PetriNetUnfolderBase]: 286/556 cut-off events. [2024-06-03 22:21:17,745 INFO L125 PetriNetUnfolderBase]: For 14862/14862 co-relation queries the response was YES. [2024-06-03 22:21:17,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3297 conditions, 556 events. 286/556 cut-off events. For 14862/14862 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2640 event pairs, 31 based on Foata normal form. 1/555 useless extension candidates. Maximal degree in co-relation 3222. Up to 422 conditions per place. [2024-06-03 22:21:17,749 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 116 selfloop transitions, 41 changer transitions 0/161 dead transitions. [2024-06-03 22:21:17,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 161 transitions, 1752 flow [2024-06-03 22:21:17,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:21:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:21:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-03 22:21:17,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2024-06-03 22:21:17,751 INFO L175 Difference]: Start difference. First operand has 161 places, 145 transitions, 1369 flow. Second operand 11 states and 145 transitions. [2024-06-03 22:21:17,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 161 transitions, 1752 flow [2024-06-03 22:21:17,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 161 transitions, 1698 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-03 22:21:17,780 INFO L231 Difference]: Finished difference. Result has 164 places, 149 transitions, 1452 flow [2024-06-03 22:21:17,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1452, PETRI_PLACES=164, PETRI_TRANSITIONS=149} [2024-06-03 22:21:17,780 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 132 predicate places. [2024-06-03 22:21:17,780 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 149 transitions, 1452 flow [2024-06-03 22:21:17,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:17,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:17,781 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-03 22:21:17,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 22:21:17,781 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-03 22:21:17,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:17,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1977980582, now seen corresponding path program 1 times [2024-06-03 22:21:17,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:17,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484891746] [2024-06-03 22:21:17,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:17,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:24,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-03 22:21:24,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:24,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484891746] [2024-06-03 22:21:24,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484891746] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:24,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:24,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:21:24,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526563568] [2024-06-03 22:21:24,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:24,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:21:24,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:24,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:21:24,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:21:24,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:21:24,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 149 transitions, 1452 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:24,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:24,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:21:24,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:24,772 INFO L124 PetriNetUnfolderBase]: 296/580 cut-off events. [2024-06-03 22:21:24,772 INFO L125 PetriNetUnfolderBase]: For 16620/16620 co-relation queries the response was YES. [2024-06-03 22:21:24,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3486 conditions, 580 events. 296/580 cut-off events. For 16620/16620 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2824 event pairs, 29 based on Foata normal form. 2/580 useless extension candidates. Maximal degree in co-relation 3409. Up to 471 conditions per place. [2024-06-03 22:21:24,777 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 134 selfloop transitions, 27 changer transitions 0/165 dead transitions. [2024-06-03 22:21:24,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 165 transitions, 1860 flow [2024-06-03 22:21:24,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:21:24,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:21:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-03 22:21:24,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4006734006734007 [2024-06-03 22:21:24,789 INFO L175 Difference]: Start difference. First operand has 164 places, 149 transitions, 1452 flow. Second operand 9 states and 119 transitions. [2024-06-03 22:21:24,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 165 transitions, 1860 flow [2024-06-03 22:21:24,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 165 transitions, 1740 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-03 22:21:24,823 INFO L231 Difference]: Finished difference. Result has 165 places, 154 transitions, 1453 flow [2024-06-03 22:21:24,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1453, PETRI_PLACES=165, PETRI_TRANSITIONS=154} [2024-06-03 22:21:24,823 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 133 predicate places. [2024-06-03 22:21:24,823 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 154 transitions, 1453 flow [2024-06-03 22:21:24,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:24,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:24,824 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-03 22:21:24,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 22:21:24,824 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-03 22:21:24,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:24,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1977832712, now seen corresponding path program 2 times [2024-06-03 22:21:24,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:24,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813972379] [2024-06-03 22:21:24,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:24,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:32,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:32,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:32,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813972379] [2024-06-03 22:21:32,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813972379] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:32,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:32,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:21:32,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815712313] [2024-06-03 22:21:32,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:32,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:21:32,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:32,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:21:32,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:21:32,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:21:32,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 154 transitions, 1453 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:32,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:32,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:21:32,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:33,301 INFO L124 PetriNetUnfolderBase]: 307/598 cut-off events. [2024-06-03 22:21:33,301 INFO L125 PetriNetUnfolderBase]: For 18806/18806 co-relation queries the response was YES. [2024-06-03 22:21:33,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3622 conditions, 598 events. 307/598 cut-off events. For 18806/18806 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2903 event pairs, 32 based on Foata normal form. 2/598 useless extension candidates. Maximal degree in co-relation 3544. Up to 435 conditions per place. [2024-06-03 22:21:33,306 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 129 selfloop transitions, 37 changer transitions 0/170 dead transitions. [2024-06-03 22:21:33,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 170 transitions, 1923 flow [2024-06-03 22:21:33,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:21:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:21:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-03 22:21:33,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-03 22:21:33,319 INFO L175 Difference]: Start difference. First operand has 165 places, 154 transitions, 1453 flow. Second operand 9 states and 123 transitions. [2024-06-03 22:21:33,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 170 transitions, 1923 flow [2024-06-03 22:21:33,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 170 transitions, 1862 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-03 22:21:33,354 INFO L231 Difference]: Finished difference. Result has 168 places, 156 transitions, 1496 flow [2024-06-03 22:21:33,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1496, PETRI_PLACES=168, PETRI_TRANSITIONS=156} [2024-06-03 22:21:33,354 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 136 predicate places. [2024-06-03 22:21:33,355 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 156 transitions, 1496 flow [2024-06-03 22:21:33,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:33,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:33,355 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-03 22:21:33,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 22:21:33,355 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-03 22:21:33,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:33,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1202526284, now seen corresponding path program 3 times [2024-06-03 22:21:33,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:33,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646781881] [2024-06-03 22:21:33,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:33,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:40,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:40,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646781881] [2024-06-03 22:21:40,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646781881] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:40,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:40,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:21:40,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417701457] [2024-06-03 22:21:40,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:40,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:21:40,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:40,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:21:40,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:21:40,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:21:40,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 156 transitions, 1496 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:40,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:40,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:21:40,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:40,523 INFO L124 PetriNetUnfolderBase]: 304/600 cut-off events. [2024-06-03 22:21:40,523 INFO L125 PetriNetUnfolderBase]: For 18289/18289 co-relation queries the response was YES. [2024-06-03 22:21:40,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3560 conditions, 600 events. 304/600 cut-off events. For 18289/18289 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2952 event pairs, 30 based on Foata normal form. 2/600 useless extension candidates. Maximal degree in co-relation 3482. Up to 487 conditions per place. [2024-06-03 22:21:40,528 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 135 selfloop transitions, 28 changer transitions 0/167 dead transitions. [2024-06-03 22:21:40,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 167 transitions, 1848 flow [2024-06-03 22:21:40,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:21:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:21:40,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-03 22:21:40,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4006734006734007 [2024-06-03 22:21:40,530 INFO L175 Difference]: Start difference. First operand has 168 places, 156 transitions, 1496 flow. Second operand 9 states and 119 transitions. [2024-06-03 22:21:40,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 167 transitions, 1848 flow [2024-06-03 22:21:40,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 167 transitions, 1787 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-03 22:21:40,566 INFO L231 Difference]: Finished difference. Result has 172 places, 156 transitions, 1496 flow [2024-06-03 22:21:40,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1496, PETRI_PLACES=172, PETRI_TRANSITIONS=156} [2024-06-03 22:21:40,566 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 140 predicate places. [2024-06-03 22:21:40,566 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 156 transitions, 1496 flow [2024-06-03 22:21:40,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:40,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:40,567 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-03 22:21:40,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 22:21:40,567 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-03 22:21:40,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:40,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1500874802, now seen corresponding path program 4 times [2024-06-03 22:21:40,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:40,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215694797] [2024-06-03 22:21:40,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:40,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:47,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-03 22:21:47,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:47,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215694797] [2024-06-03 22:21:47,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215694797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:47,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:47,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:21:47,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433783863] [2024-06-03 22:21:47,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:47,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:21:47,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:47,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:21:47,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:21:47,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:21:47,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 156 transitions, 1496 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:47,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:47,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:21:47,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:48,342 INFO L124 PetriNetUnfolderBase]: 315/621 cut-off events. [2024-06-03 22:21:48,342 INFO L125 PetriNetUnfolderBase]: For 20818/20818 co-relation queries the response was YES. [2024-06-03 22:21:48,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3770 conditions, 621 events. 315/621 cut-off events. For 20818/20818 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3092 event pairs, 31 based on Foata normal form. 2/621 useless extension candidates. Maximal degree in co-relation 3690. Up to 489 conditions per place. [2024-06-03 22:21:48,347 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 145 selfloop transitions, 25 changer transitions 0/174 dead transitions. [2024-06-03 22:21:48,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 174 transitions, 1988 flow [2024-06-03 22:21:48,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:21:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:21:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-03 22:21:48,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-03 22:21:48,349 INFO L175 Difference]: Start difference. First operand has 172 places, 156 transitions, 1496 flow. Second operand 9 states and 123 transitions. [2024-06-03 22:21:48,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 174 transitions, 1988 flow [2024-06-03 22:21:48,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 174 transitions, 1905 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-03 22:21:48,392 INFO L231 Difference]: Finished difference. Result has 172 places, 158 transitions, 1497 flow [2024-06-03 22:21:48,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1413, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1497, PETRI_PLACES=172, PETRI_TRANSITIONS=158} [2024-06-03 22:21:48,392 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 140 predicate places. [2024-06-03 22:21:48,392 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 158 transitions, 1497 flow [2024-06-03 22:21:48,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:48,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:48,393 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-03 22:21:48,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 22:21:48,393 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-03 22:21:48,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:48,393 INFO L85 PathProgramCache]: Analyzing trace with hash 981172548, now seen corresponding path program 5 times [2024-06-03 22:21:48,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:48,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962027575] [2024-06-03 22:21:48,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:48,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:55,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:55,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962027575] [2024-06-03 22:21:55,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962027575] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:55,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:55,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:21:55,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711357700] [2024-06-03 22:21:55,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:55,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:21:55,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:55,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:21:55,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:21:55,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:21:55,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 158 transitions, 1497 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:55,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:55,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:21:55,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:55,700 INFO L124 PetriNetUnfolderBase]: 312/610 cut-off events. [2024-06-03 22:21:55,701 INFO L125 PetriNetUnfolderBase]: For 19821/19821 co-relation queries the response was YES. [2024-06-03 22:21:55,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3664 conditions, 610 events. 312/610 cut-off events. For 19821/19821 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3000 event pairs, 33 based on Foata normal form. 2/610 useless extension candidates. Maximal degree in co-relation 3583. Up to 503 conditions per place. [2024-06-03 22:21:55,705 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 143 selfloop transitions, 25 changer transitions 0/172 dead transitions. [2024-06-03 22:21:55,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 172 transitions, 1869 flow [2024-06-03 22:21:55,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:21:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:21:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-03 22:21:55,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2024-06-03 22:21:55,706 INFO L175 Difference]: Start difference. First operand has 172 places, 158 transitions, 1497 flow. Second operand 9 states and 120 transitions. [2024-06-03 22:21:55,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 172 transitions, 1869 flow [2024-06-03 22:21:55,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 172 transitions, 1814 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-03 22:21:55,741 INFO L231 Difference]: Finished difference. Result has 176 places, 158 transitions, 1497 flow [2024-06-03 22:21:55,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1497, PETRI_PLACES=176, PETRI_TRANSITIONS=158} [2024-06-03 22:21:55,741 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 144 predicate places. [2024-06-03 22:21:55,741 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 158 transitions, 1497 flow [2024-06-03 22:21:55,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:55,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:55,742 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-03 22:21:55,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 22:21:55,742 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-03 22:21:55,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:55,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1770362120, now seen corresponding path program 6 times [2024-06-03 22:21:55,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:55,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96009194] [2024-06-03 22:21:55,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:55,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:02,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-03 22:22:02,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:02,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96009194] [2024-06-03 22:22:02,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96009194] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:02,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:02,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:22:02,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135371434] [2024-06-03 22:22:02,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:02,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:22:02,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:02,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:22:02,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:22:02,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:22:02,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 158 transitions, 1497 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:02,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:02,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:22:02,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:03,182 INFO L124 PetriNetUnfolderBase]: 316/618 cut-off events. [2024-06-03 22:22:03,182 INFO L125 PetriNetUnfolderBase]: For 20395/20395 co-relation queries the response was YES. [2024-06-03 22:22:03,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3721 conditions, 618 events. 316/618 cut-off events. For 20395/20395 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3043 event pairs, 29 based on Foata normal form. 2/618 useless extension candidates. Maximal degree in co-relation 3638. Up to 493 conditions per place. [2024-06-03 22:22:03,187 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 152 selfloop transitions, 19 changer transitions 0/175 dead transitions. [2024-06-03 22:22:03,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 175 transitions, 1895 flow [2024-06-03 22:22:03,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:22:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:22:03,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-03 22:22:03,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4006734006734007 [2024-06-03 22:22:03,188 INFO L175 Difference]: Start difference. First operand has 176 places, 158 transitions, 1497 flow. Second operand 9 states and 119 transitions. [2024-06-03 22:22:03,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 175 transitions, 1895 flow [2024-06-03 22:22:03,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 175 transitions, 1842 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-03 22:22:03,236 INFO L231 Difference]: Finished difference. Result has 177 places, 159 transitions, 1504 flow [2024-06-03 22:22:03,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1444, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1504, PETRI_PLACES=177, PETRI_TRANSITIONS=159} [2024-06-03 22:22:03,236 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 145 predicate places. [2024-06-03 22:22:03,236 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 159 transitions, 1504 flow [2024-06-03 22:22:03,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:03,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:03,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:03,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 22:22:03,237 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-03 22:22:03,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:03,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2110050492, now seen corresponding path program 1 times [2024-06-03 22:22:03,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:03,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351589069] [2024-06-03 22:22:03,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:03,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:09,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:09,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351589069] [2024-06-03 22:22:09,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351589069] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:09,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:09,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:22:09,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844725652] [2024-06-03 22:22:09,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:09,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:22:09,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:09,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:22:09,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:22:09,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:22:09,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 159 transitions, 1504 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:09,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:09,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:22:09,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:10,090 INFO L124 PetriNetUnfolderBase]: 320/626 cut-off events. [2024-06-03 22:22:10,091 INFO L125 PetriNetUnfolderBase]: For 21428/21428 co-relation queries the response was YES. [2024-06-03 22:22:10,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3782 conditions, 626 events. 320/626 cut-off events. For 21428/21428 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3092 event pairs, 33 based on Foata normal form. 2/626 useless extension candidates. Maximal degree in co-relation 3698. Up to 522 conditions per place. [2024-06-03 22:22:10,095 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 144 selfloop transitions, 25 changer transitions 0/173 dead transitions. [2024-06-03 22:22:10,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 173 transitions, 1888 flow [2024-06-03 22:22:10,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:22:10,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:22:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-03 22:22:10,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38292011019283745 [2024-06-03 22:22:10,098 INFO L175 Difference]: Start difference. First operand has 177 places, 159 transitions, 1504 flow. Second operand 11 states and 139 transitions. [2024-06-03 22:22:10,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 173 transitions, 1888 flow [2024-06-03 22:22:10,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 173 transitions, 1838 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-03 22:22:10,144 INFO L231 Difference]: Finished difference. Result has 181 places, 160 transitions, 1526 flow [2024-06-03 22:22:10,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1526, PETRI_PLACES=181, PETRI_TRANSITIONS=160} [2024-06-03 22:22:10,145 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-03 22:22:10,145 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 160 transitions, 1526 flow [2024-06-03 22:22:10,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:10,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:10,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:10,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 22:22:10,145 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-03 22:22:10,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:10,146 INFO L85 PathProgramCache]: Analyzing trace with hash -391859854, now seen corresponding path program 7 times [2024-06-03 22:22:10,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:10,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55705641] [2024-06-03 22:22:10,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:10,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:17,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:17,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:17,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55705641] [2024-06-03 22:22:17,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55705641] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:17,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:17,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:22:17,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436911871] [2024-06-03 22:22:17,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:17,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:22:17,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:17,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:22:17,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:22:17,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:22:17,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 160 transitions, 1526 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:17,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:17,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:22:17,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:17,968 INFO L124 PetriNetUnfolderBase]: 324/634 cut-off events. [2024-06-03 22:22:17,968 INFO L125 PetriNetUnfolderBase]: For 22385/22385 co-relation queries the response was YES. [2024-06-03 22:22:17,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3846 conditions, 634 events. 324/634 cut-off events. For 22385/22385 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3170 event pairs, 38 based on Foata normal form. 2/630 useless extension candidates. Maximal degree in co-relation 3761. Up to 502 conditions per place. [2024-06-03 22:22:17,973 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 130 selfloop transitions, 36 changer transitions 0/170 dead transitions. [2024-06-03 22:22:17,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 170 transitions, 1896 flow [2024-06-03 22:22:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:22:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:22:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-03 22:22:17,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2024-06-03 22:22:17,975 INFO L175 Difference]: Start difference. First operand has 181 places, 160 transitions, 1526 flow. Second operand 9 states and 121 transitions. [2024-06-03 22:22:17,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 170 transitions, 1896 flow [2024-06-03 22:22:18,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 170 transitions, 1834 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-03 22:22:18,018 INFO L231 Difference]: Finished difference. Result has 181 places, 161 transitions, 1560 flow [2024-06-03 22:22:18,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1560, PETRI_PLACES=181, PETRI_TRANSITIONS=161} [2024-06-03 22:22:18,018 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-03 22:22:18,018 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 161 transitions, 1560 flow [2024-06-03 22:22:18,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:18,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:18,019 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-03 22:22:18,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 22:22:18,019 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-03 22:22:18,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:18,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2085042962, now seen corresponding path program 8 times [2024-06-03 22:22:18,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:18,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077288976] [2024-06-03 22:22:18,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:18,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:25,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-03 22:22:25,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:25,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077288976] [2024-06-03 22:22:25,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077288976] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:25,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:25,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:22:25,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290283551] [2024-06-03 22:22:25,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:25,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:22:25,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:25,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:22:25,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:22:25,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:22:25,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 161 transitions, 1560 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:25,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:25,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:22:25,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:25,715 INFO L124 PetriNetUnfolderBase]: 328/642 cut-off events. [2024-06-03 22:22:25,715 INFO L125 PetriNetUnfolderBase]: For 23419/23419 co-relation queries the response was YES. [2024-06-03 22:22:25,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3914 conditions, 642 events. 328/642 cut-off events. For 23419/23419 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3221 event pairs, 40 based on Foata normal form. 2/638 useless extension candidates. Maximal degree in co-relation 3828. Up to 510 conditions per place. [2024-06-03 22:22:25,719 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 130 selfloop transitions, 37 changer transitions 0/171 dead transitions. [2024-06-03 22:22:25,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 171 transitions, 1934 flow [2024-06-03 22:22:25,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:22:25,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:22:25,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-03 22:22:25,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2024-06-03 22:22:25,721 INFO L175 Difference]: Start difference. First operand has 181 places, 161 transitions, 1560 flow. Second operand 9 states and 120 transitions. [2024-06-03 22:22:25,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 171 transitions, 1934 flow [2024-06-03 22:22:25,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 171 transitions, 1848 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 22:22:25,768 INFO L231 Difference]: Finished difference. Result has 183 places, 162 transitions, 1574 flow [2024-06-03 22:22:25,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1574, PETRI_PLACES=183, PETRI_TRANSITIONS=162} [2024-06-03 22:22:25,769 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 151 predicate places. [2024-06-03 22:22:25,769 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 162 transitions, 1574 flow [2024-06-03 22:22:25,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:25,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:25,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:25,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 22:22:25,770 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-03 22:22:25,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:25,770 INFO L85 PathProgramCache]: Analyzing trace with hash -397370104, now seen corresponding path program 9 times [2024-06-03 22:22:25,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:25,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888378943] [2024-06-03 22:22:25,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:25,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:32,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:32,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:32,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888378943] [2024-06-03 22:22:32,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888378943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:32,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:32,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:22:32,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754844584] [2024-06-03 22:22:32,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:32,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:22:32,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:32,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:22:32,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:22:32,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:22:32,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 162 transitions, 1574 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:32,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:32,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:22:32,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:33,111 INFO L124 PetriNetUnfolderBase]: 332/650 cut-off events. [2024-06-03 22:22:33,111 INFO L125 PetriNetUnfolderBase]: For 24466/24466 co-relation queries the response was YES. [2024-06-03 22:22:33,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3971 conditions, 650 events. 332/650 cut-off events. For 24466/24466 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3268 event pairs, 38 based on Foata normal form. 2/646 useless extension candidates. Maximal degree in co-relation 3884. Up to 489 conditions per place. [2024-06-03 22:22:33,116 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 130 selfloop transitions, 40 changer transitions 0/174 dead transitions. [2024-06-03 22:22:33,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 174 transitions, 2056 flow [2024-06-03 22:22:33,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:22:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:22:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-03 22:22:33,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107744107744108 [2024-06-03 22:22:33,117 INFO L175 Difference]: Start difference. First operand has 183 places, 162 transitions, 1574 flow. Second operand 9 states and 122 transitions. [2024-06-03 22:22:33,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 174 transitions, 2056 flow [2024-06-03 22:22:33,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 174 transitions, 1966 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-03 22:22:33,167 INFO L231 Difference]: Finished difference. Result has 185 places, 163 transitions, 1590 flow [2024-06-03 22:22:33,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1590, PETRI_PLACES=185, PETRI_TRANSITIONS=163} [2024-06-03 22:22:33,167 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 153 predicate places. [2024-06-03 22:22:33,167 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 163 transitions, 1590 flow [2024-06-03 22:22:33,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:33,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:33,167 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-03 22:22:33,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 22:22:33,168 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-03 22:22:33,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:33,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1916858796, now seen corresponding path program 10 times [2024-06-03 22:22:33,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:33,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569056278] [2024-06-03 22:22:33,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:33,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:40,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:40,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569056278] [2024-06-03 22:22:40,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569056278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:40,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:40,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:22:40,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811399034] [2024-06-03 22:22:40,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:40,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:22:40,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:40,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:22:40,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:22:40,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:22:40,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 163 transitions, 1590 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:40,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:40,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:22:40,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:40,883 INFO L124 PetriNetUnfolderBase]: 329/645 cut-off events. [2024-06-03 22:22:40,883 INFO L125 PetriNetUnfolderBase]: For 22905/22905 co-relation queries the response was YES. [2024-06-03 22:22:40,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3846 conditions, 645 events. 329/645 cut-off events. For 22905/22905 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3245 event pairs, 39 based on Foata normal form. 2/641 useless extension candidates. Maximal degree in co-relation 3758. Up to 513 conditions per place. [2024-06-03 22:22:40,888 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 128 selfloop transitions, 40 changer transitions 0/172 dead transitions. [2024-06-03 22:22:40,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 172 transitions, 1946 flow [2024-06-03 22:22:40,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:22:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:22:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-03 22:22:40,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4006734006734007 [2024-06-03 22:22:40,889 INFO L175 Difference]: Start difference. First operand has 185 places, 163 transitions, 1590 flow. Second operand 9 states and 119 transitions. [2024-06-03 22:22:40,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 172 transitions, 1946 flow [2024-06-03 22:22:40,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 172 transitions, 1809 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-03 22:22:40,944 INFO L231 Difference]: Finished difference. Result has 186 places, 163 transitions, 1537 flow [2024-06-03 22:22:40,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1537, PETRI_PLACES=186, PETRI_TRANSITIONS=163} [2024-06-03 22:22:40,944 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 154 predicate places. [2024-06-03 22:22:40,944 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 163 transitions, 1537 flow [2024-06-03 22:22:40,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:40,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:40,944 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-03 22:22:40,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 22:22:40,945 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-03 22:22:40,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:40,945 INFO L85 PathProgramCache]: Analyzing trace with hash -190286012, now seen corresponding path program 2 times [2024-06-03 22:22:40,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:40,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383621134] [2024-06-03 22:22:40,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:40,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:47,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:47,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:47,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383621134] [2024-06-03 22:22:47,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383621134] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:47,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:47,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:22:47,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97515872] [2024-06-03 22:22:47,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:47,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:22:47,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:47,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:22:47,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:22:47,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:22:47,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 163 transitions, 1537 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:47,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:47,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:22:47,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:48,152 INFO L124 PetriNetUnfolderBase]: 333/651 cut-off events. [2024-06-03 22:22:48,152 INFO L125 PetriNetUnfolderBase]: For 23482/23482 co-relation queries the response was YES. [2024-06-03 22:22:48,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3765 conditions, 651 events. 333/651 cut-off events. For 23482/23482 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3272 event pairs, 39 based on Foata normal form. 2/647 useless extension candidates. Maximal degree in co-relation 3678. Up to 509 conditions per place. [2024-06-03 22:22:48,157 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 133 selfloop transitions, 38 changer transitions 0/175 dead transitions. [2024-06-03 22:22:48,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 175 transitions, 1921 flow [2024-06-03 22:22:48,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:22:48,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:22:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-03 22:22:48,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39669421487603307 [2024-06-03 22:22:48,159 INFO L175 Difference]: Start difference. First operand has 186 places, 163 transitions, 1537 flow. Second operand 11 states and 144 transitions. [2024-06-03 22:22:48,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 175 transitions, 1921 flow [2024-06-03 22:22:48,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 175 transitions, 1732 flow, removed 3 selfloop flow, removed 13 redundant places. [2024-06-03 22:22:48,214 INFO L231 Difference]: Finished difference. Result has 184 places, 164 transitions, 1448 flow [2024-06-03 22:22:48,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1448, PETRI_PLACES=184, PETRI_TRANSITIONS=164} [2024-06-03 22:22:48,215 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 152 predicate places. [2024-06-03 22:22:48,215 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 164 transitions, 1448 flow [2024-06-03 22:22:48,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:48,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:48,215 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-03 22:22:48,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 22:22:48,215 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-03 22:22:48,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:48,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1493568226, now seen corresponding path program 3 times [2024-06-03 22:22:48,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:48,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61561603] [2024-06-03 22:22:48,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:48,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:55,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:55,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:55,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61561603] [2024-06-03 22:22:55,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61561603] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:55,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:55,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:22:55,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254086215] [2024-06-03 22:22:55,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:55,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:22:55,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:55,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:22:55,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:22:55,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:22:55,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 164 transitions, 1448 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:55,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:55,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:22:55,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:55,420 INFO L124 PetriNetUnfolderBase]: 337/665 cut-off events. [2024-06-03 22:22:55,420 INFO L125 PetriNetUnfolderBase]: For 24373/24373 co-relation queries the response was YES. [2024-06-03 22:22:55,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3721 conditions, 665 events. 337/665 cut-off events. For 24373/24373 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3390 event pairs, 39 based on Foata normal form. 2/661 useless extension candidates. Maximal degree in co-relation 3634. Up to 517 conditions per place. [2024-06-03 22:22:55,425 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 132 selfloop transitions, 40 changer transitions 0/176 dead transitions. [2024-06-03 22:22:55,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 176 transitions, 1836 flow [2024-06-03 22:22:55,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:22:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:22:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2024-06-03 22:22:55,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-03 22:22:55,450 INFO L175 Difference]: Start difference. First operand has 184 places, 164 transitions, 1448 flow. Second operand 11 states and 143 transitions. [2024-06-03 22:22:55,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 176 transitions, 1836 flow [2024-06-03 22:22:55,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 176 transitions, 1746 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-03 22:22:55,501 INFO L231 Difference]: Finished difference. Result has 186 places, 165 transitions, 1464 flow [2024-06-03 22:22:55,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1358, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1464, PETRI_PLACES=186, PETRI_TRANSITIONS=165} [2024-06-03 22:22:55,502 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 154 predicate places. [2024-06-03 22:22:55,502 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 165 transitions, 1464 flow [2024-06-03 22:22:55,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:55,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:55,502 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-03 22:22:55,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 22:22:55,502 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-03 22:22:55,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:55,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1741729604, now seen corresponding path program 4 times [2024-06-03 22:22:55,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:55,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266530169] [2024-06-03 22:22:55,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:55,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:02,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:02,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266530169] [2024-06-03 22:23:02,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266530169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:02,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:02,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:23:02,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838485143] [2024-06-03 22:23:02,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:02,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:23:02,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:02,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:23:02,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:23:02,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:23:02,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 165 transitions, 1464 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:02,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:02,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:23:02,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:02,708 INFO L124 PetriNetUnfolderBase]: 341/679 cut-off events. [2024-06-03 22:23:02,708 INFO L125 PetriNetUnfolderBase]: For 25364/25364 co-relation queries the response was YES. [2024-06-03 22:23:02,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3784 conditions, 679 events. 341/679 cut-off events. For 25364/25364 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3505 event pairs, 41 based on Foata normal form. 2/675 useless extension candidates. Maximal degree in co-relation 3696. Up to 525 conditions per place. [2024-06-03 22:23:02,713 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 130 selfloop transitions, 43 changer transitions 0/177 dead transitions. [2024-06-03 22:23:02,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 177 transitions, 1856 flow [2024-06-03 22:23:02,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:23:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:23:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-03 22:23:02,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39118457300275483 [2024-06-03 22:23:02,715 INFO L175 Difference]: Start difference. First operand has 186 places, 165 transitions, 1464 flow. Second operand 11 states and 142 transitions. [2024-06-03 22:23:02,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 177 transitions, 1856 flow [2024-06-03 22:23:02,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 177 transitions, 1760 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-03 22:23:02,768 INFO L231 Difference]: Finished difference. Result has 188 places, 166 transitions, 1482 flow [2024-06-03 22:23:02,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1482, PETRI_PLACES=188, PETRI_TRANSITIONS=166} [2024-06-03 22:23:02,769 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 156 predicate places. [2024-06-03 22:23:02,769 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 166 transitions, 1482 flow [2024-06-03 22:23:02,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:02,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:02,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:02,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 22:23:02,770 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-03 22:23:02,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:02,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2066856674, now seen corresponding path program 5 times [2024-06-03 22:23:02,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:02,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826957417] [2024-06-03 22:23:02,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:02,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:10,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:10,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826957417] [2024-06-03 22:23:10,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826957417] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:10,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:10,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:23:10,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129605735] [2024-06-03 22:23:10,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:10,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:23:10,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:10,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:23:10,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:23:10,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:23:10,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 166 transitions, 1482 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:10,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:10,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:23:10,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:10,697 INFO L124 PetriNetUnfolderBase]: 345/682 cut-off events. [2024-06-03 22:23:10,698 INFO L125 PetriNetUnfolderBase]: For 26284/26284 co-relation queries the response was YES. [2024-06-03 22:23:10,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3838 conditions, 682 events. 345/682 cut-off events. For 26284/26284 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3479 event pairs, 49 based on Foata normal form. 2/682 useless extension candidates. Maximal degree in co-relation 3749. Up to 570 conditions per place. [2024-06-03 22:23:10,703 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 156 selfloop transitions, 23 changer transitions 0/183 dead transitions. [2024-06-03 22:23:10,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 183 transitions, 2014 flow [2024-06-03 22:23:10,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:23:10,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:23:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2024-06-03 22:23:10,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37626262626262624 [2024-06-03 22:23:10,705 INFO L175 Difference]: Start difference. First operand has 188 places, 166 transitions, 1482 flow. Second operand 12 states and 149 transitions. [2024-06-03 22:23:10,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 183 transitions, 2014 flow [2024-06-03 22:23:10,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 183 transitions, 1908 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-03 22:23:10,764 INFO L231 Difference]: Finished difference. Result has 193 places, 169 transitions, 1478 flow [2024-06-03 22:23:10,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1378, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1478, PETRI_PLACES=193, PETRI_TRANSITIONS=169} [2024-06-03 22:23:10,765 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 161 predicate places. [2024-06-03 22:23:10,765 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 169 transitions, 1478 flow [2024-06-03 22:23:10,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:10,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:10,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-03 22:23:10,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 22:23:10,765 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-03 22:23:10,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:10,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2066470724, now seen corresponding path program 6 times [2024-06-03 22:23:10,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:10,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732814898] [2024-06-03 22:23:10,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:10,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:17,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:17,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:17,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732814898] [2024-06-03 22:23:17,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732814898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:17,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:17,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:23:17,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364051816] [2024-06-03 22:23:17,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:17,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:23:17,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:17,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:23:17,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:23:18,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:23:18,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 169 transitions, 1478 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:18,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:18,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:23:18,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:18,456 INFO L124 PetriNetUnfolderBase]: 349/688 cut-off events. [2024-06-03 22:23:18,456 INFO L125 PetriNetUnfolderBase]: For 27276/27276 co-relation queries the response was YES. [2024-06-03 22:23:18,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3858 conditions, 688 events. 349/688 cut-off events. For 27276/27276 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3499 event pairs, 51 based on Foata normal form. 2/688 useless extension candidates. Maximal degree in co-relation 3766. Up to 597 conditions per place. [2024-06-03 22:23:18,461 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 156 selfloop transitions, 22 changer transitions 0/182 dead transitions. [2024-06-03 22:23:18,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 182 transitions, 1886 flow [2024-06-03 22:23:18,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:23:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:23:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 148 transitions. [2024-06-03 22:23:18,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37373737373737376 [2024-06-03 22:23:18,463 INFO L175 Difference]: Start difference. First operand has 193 places, 169 transitions, 1478 flow. Second operand 12 states and 148 transitions. [2024-06-03 22:23:18,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 182 transitions, 1886 flow [2024-06-03 22:23:18,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 182 transitions, 1789 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-03 22:23:18,520 INFO L231 Difference]: Finished difference. Result has 196 places, 170 transitions, 1457 flow [2024-06-03 22:23:18,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1386, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1457, PETRI_PLACES=196, PETRI_TRANSITIONS=170} [2024-06-03 22:23:18,521 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 164 predicate places. [2024-06-03 22:23:18,521 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 170 transitions, 1457 flow [2024-06-03 22:23:18,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:18,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:18,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-03 22:23:18,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 22:23:18,521 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-03 22:23:18,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:18,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2055428834, now seen corresponding path program 7 times [2024-06-03 22:23:18,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:18,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064636172] [2024-06-03 22:23:18,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:18,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:26,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:26,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064636172] [2024-06-03 22:23:26,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064636172] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:26,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:26,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:23:26,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142775118] [2024-06-03 22:23:26,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:26,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:23:26,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:26,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:23:26,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:23:26,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:23:26,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 170 transitions, 1457 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:26,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:26,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:23:26,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:26,751 INFO L124 PetriNetUnfolderBase]: 358/711 cut-off events. [2024-06-03 22:23:26,751 INFO L125 PetriNetUnfolderBase]: For 36655/36655 co-relation queries the response was YES. [2024-06-03 22:23:26,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3729 conditions, 711 events. 358/711 cut-off events. For 36655/36655 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3656 event pairs, 54 based on Foata normal form. 10/719 useless extension candidates. Maximal degree in co-relation 3638. Up to 588 conditions per place. [2024-06-03 22:23:26,756 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 156 selfloop transitions, 18 changer transitions 6/184 dead transitions. [2024-06-03 22:23:26,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 184 transitions, 1887 flow [2024-06-03 22:23:26,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:23:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:23:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-06-03 22:23:26,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3884297520661157 [2024-06-03 22:23:26,757 INFO L175 Difference]: Start difference. First operand has 196 places, 170 transitions, 1457 flow. Second operand 11 states and 141 transitions. [2024-06-03 22:23:26,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 184 transitions, 1887 flow [2024-06-03 22:23:26,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 184 transitions, 1798 flow, removed 20 selfloop flow, removed 10 redundant places. [2024-06-03 22:23:26,811 INFO L231 Difference]: Finished difference. Result has 197 places, 167 transitions, 1386 flow [2024-06-03 22:23:26,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1386, PETRI_PLACES=197, PETRI_TRANSITIONS=167} [2024-06-03 22:23:26,811 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 165 predicate places. [2024-06-03 22:23:26,811 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 167 transitions, 1386 flow [2024-06-03 22:23:26,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:26,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:26,812 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-03 22:23:26,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 22:23:26,812 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-03 22:23:26,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:26,812 INFO L85 PathProgramCache]: Analyzing trace with hash 699705312, now seen corresponding path program 1 times [2024-06-03 22:23:26,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:26,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955215688] [2024-06-03 22:23:26,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:26,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:33,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:33,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:33,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955215688] [2024-06-03 22:23:33,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955215688] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:33,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:33,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:23:33,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092932200] [2024-06-03 22:23:33,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:33,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:23:33,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:33,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:23:33,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:23:33,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:23:33,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 167 transitions, 1386 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:33,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:33,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:23:33,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:34,073 INFO L124 PetriNetUnfolderBase]: 353/697 cut-off events. [2024-06-03 22:23:34,074 INFO L125 PetriNetUnfolderBase]: For 23939/23939 co-relation queries the response was YES. [2024-06-03 22:23:34,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3599 conditions, 697 events. 353/697 cut-off events. For 23939/23939 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3578 event pairs, 35 based on Foata normal form. 1/696 useless extension candidates. Maximal degree in co-relation 3507. Up to 596 conditions per place. [2024-06-03 22:23:34,079 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 162 selfloop transitions, 25 changer transitions 0/191 dead transitions. [2024-06-03 22:23:34,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 191 transitions, 1887 flow [2024-06-03 22:23:34,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:23:34,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:23:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2024-06-03 22:23:34,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-03 22:23:34,081 INFO L175 Difference]: Start difference. First operand has 197 places, 167 transitions, 1386 flow. Second operand 11 states and 143 transitions. [2024-06-03 22:23:34,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 191 transitions, 1887 flow [2024-06-03 22:23:34,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 191 transitions, 1832 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-06-03 22:23:34,138 INFO L231 Difference]: Finished difference. Result has 200 places, 177 transitions, 1512 flow [2024-06-03 22:23:34,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1331, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1512, PETRI_PLACES=200, PETRI_TRANSITIONS=177} [2024-06-03 22:23:34,138 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 168 predicate places. [2024-06-03 22:23:34,138 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 177 transitions, 1512 flow [2024-06-03 22:23:34,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:34,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:34,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:34,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 22:23:34,139 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-03 22:23:34,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:34,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1259079390, now seen corresponding path program 2 times [2024-06-03 22:23:34,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:34,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115697253] [2024-06-03 22:23:34,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:34,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:41,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:41,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115697253] [2024-06-03 22:23:41,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115697253] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:41,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:41,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:23:41,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276711647] [2024-06-03 22:23:41,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:41,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:23:41,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:41,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:23:41,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:23:42,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:23:42,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 177 transitions, 1512 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:42,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:42,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:23:42,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:42,398 INFO L124 PetriNetUnfolderBase]: 354/701 cut-off events. [2024-06-03 22:23:42,398 INFO L125 PetriNetUnfolderBase]: For 24926/24926 co-relation queries the response was YES. [2024-06-03 22:23:42,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3643 conditions, 701 events. 354/701 cut-off events. For 24926/24926 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3626 event pairs, 35 based on Foata normal form. 2/701 useless extension candidates. Maximal degree in co-relation 3547. Up to 595 conditions per place. [2024-06-03 22:23:42,403 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 165 selfloop transitions, 26 changer transitions 0/195 dead transitions. [2024-06-03 22:23:42,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 195 transitions, 1990 flow [2024-06-03 22:23:42,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:23:42,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:23:42,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-03 22:23:42,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39669421487603307 [2024-06-03 22:23:42,405 INFO L175 Difference]: Start difference. First operand has 200 places, 177 transitions, 1512 flow. Second operand 11 states and 144 transitions. [2024-06-03 22:23:42,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 195 transitions, 1990 flow [2024-06-03 22:23:42,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 195 transitions, 1923 flow, removed 23 selfloop flow, removed 3 redundant places. [2024-06-03 22:23:42,458 INFO L231 Difference]: Finished difference. Result has 208 places, 179 transitions, 1552 flow [2024-06-03 22:23:42,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1445, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1552, PETRI_PLACES=208, PETRI_TRANSITIONS=179} [2024-06-03 22:23:42,459 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 176 predicate places. [2024-06-03 22:23:42,459 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 179 transitions, 1552 flow [2024-06-03 22:23:42,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:42,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:42,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:42,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 22:23:42,460 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-03 22:23:42,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:42,460 INFO L85 PathProgramCache]: Analyzing trace with hash -349384776, now seen corresponding path program 1 times [2024-06-03 22:23:42,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:42,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176643470] [2024-06-03 22:23:42,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:42,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:49,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:49,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176643470] [2024-06-03 22:23:49,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176643470] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:49,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:49,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:23:49,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373049446] [2024-06-03 22:23:49,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:49,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:23:49,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:49,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:23:49,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:23:49,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:23:49,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 179 transitions, 1552 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:49,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:49,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:23:49,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:50,302 INFO L124 PetriNetUnfolderBase]: 364/721 cut-off events. [2024-06-03 22:23:50,302 INFO L125 PetriNetUnfolderBase]: For 25996/25996 co-relation queries the response was YES. [2024-06-03 22:23:50,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 721 events. 364/721 cut-off events. For 25996/25996 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3768 event pairs, 38 based on Foata normal form. 2/721 useless extension candidates. Maximal degree in co-relation 3654. Up to 584 conditions per place. [2024-06-03 22:23:50,308 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 158 selfloop transitions, 34 changer transitions 0/196 dead transitions. [2024-06-03 22:23:50,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 196 transitions, 2019 flow [2024-06-03 22:23:50,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:23:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:23:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-03 22:23:50,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 22:23:50,309 INFO L175 Difference]: Start difference. First operand has 208 places, 179 transitions, 1552 flow. Second operand 10 states and 132 transitions. [2024-06-03 22:23:50,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 196 transitions, 2019 flow [2024-06-03 22:23:50,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 196 transitions, 1883 flow, removed 33 selfloop flow, removed 11 redundant places. [2024-06-03 22:23:50,377 INFO L231 Difference]: Finished difference. Result has 207 places, 184 transitions, 1546 flow [2024-06-03 22:23:50,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1416, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1546, PETRI_PLACES=207, PETRI_TRANSITIONS=184} [2024-06-03 22:23:50,377 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 175 predicate places. [2024-06-03 22:23:50,377 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 184 transitions, 1546 flow [2024-06-03 22:23:50,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:50,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:50,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:50,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 22:23:50,378 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-03 22:23:50,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:50,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1187856824, now seen corresponding path program 2 times [2024-06-03 22:23:50,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:50,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675247742] [2024-06-03 22:23:50,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:50,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:57,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-03 22:23:57,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:57,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675247742] [2024-06-03 22:23:57,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675247742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:57,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:57,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:23:57,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819223545] [2024-06-03 22:23:57,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:57,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:23:57,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:57,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:23:57,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:23:58,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:23:58,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 184 transitions, 1546 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:58,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:58,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:23:58,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:58,331 INFO L124 PetriNetUnfolderBase]: 368/729 cut-off events. [2024-06-03 22:23:58,331 INFO L125 PetriNetUnfolderBase]: For 26310/26310 co-relation queries the response was YES. [2024-06-03 22:23:58,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3709 conditions, 729 events. 368/729 cut-off events. For 26310/26310 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3821 event pairs, 38 based on Foata normal form. 2/729 useless extension candidates. Maximal degree in co-relation 3616. Up to 576 conditions per place. [2024-06-03 22:23:58,336 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 160 selfloop transitions, 34 changer transitions 0/198 dead transitions. [2024-06-03 22:23:58,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 198 transitions, 1976 flow [2024-06-03 22:23:58,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:23:58,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:23:58,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-03 22:23:58,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2024-06-03 22:23:58,337 INFO L175 Difference]: Start difference. First operand has 207 places, 184 transitions, 1546 flow. Second operand 10 states and 134 transitions. [2024-06-03 22:23:58,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 198 transitions, 1976 flow [2024-06-03 22:23:58,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 198 transitions, 1909 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 22:23:58,395 INFO L231 Difference]: Finished difference. Result has 210 places, 185 transitions, 1565 flow [2024-06-03 22:23:58,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1479, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1565, PETRI_PLACES=210, PETRI_TRANSITIONS=185} [2024-06-03 22:23:58,395 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 178 predicate places. [2024-06-03 22:23:58,395 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 185 transitions, 1565 flow [2024-06-03 22:23:58,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:58,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:58,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:58,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-03 22:23:58,396 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-03 22:23:58,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:58,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1183272854, now seen corresponding path program 3 times [2024-06-03 22:23:58,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:58,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114603873] [2024-06-03 22:23:58,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:58,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:05,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:05,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114603873] [2024-06-03 22:24:05,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114603873] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:05,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:05,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:24:05,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708631977] [2024-06-03 22:24:05,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:05,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:24:05,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:05,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:24:05,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:24:05,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:24:05,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 185 transitions, 1565 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:05,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:05,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:24:05,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:06,197 INFO L124 PetriNetUnfolderBase]: 379/749 cut-off events. [2024-06-03 22:24:06,198 INFO L125 PetriNetUnfolderBase]: For 30916/30916 co-relation queries the response was YES. [2024-06-03 22:24:06,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3945 conditions, 749 events. 379/749 cut-off events. For 30916/30916 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3939 event pairs, 36 based on Foata normal form. 2/749 useless extension candidates. Maximal degree in co-relation 3852. Up to 507 conditions per place. [2024-06-03 22:24:06,203 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 147 selfloop transitions, 51 changer transitions 0/202 dead transitions. [2024-06-03 22:24:06,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 202 transitions, 2143 flow [2024-06-03 22:24:06,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:06,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:06,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-03 22:24:06,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-03 22:24:06,204 INFO L175 Difference]: Start difference. First operand has 210 places, 185 transitions, 1565 flow. Second operand 10 states and 137 transitions. [2024-06-03 22:24:06,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 202 transitions, 2143 flow [2024-06-03 22:24:06,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 202 transitions, 2067 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-03 22:24:06,274 INFO L231 Difference]: Finished difference. Result has 212 places, 187 transitions, 1625 flow [2024-06-03 22:24:06,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1625, PETRI_PLACES=212, PETRI_TRANSITIONS=187} [2024-06-03 22:24:06,275 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 180 predicate places. [2024-06-03 22:24:06,275 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 187 transitions, 1625 flow [2024-06-03 22:24:06,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:06,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:06,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:06,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-03 22:24:06,276 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-03 22:24:06,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:06,276 INFO L85 PathProgramCache]: Analyzing trace with hash -995643498, now seen corresponding path program 4 times [2024-06-03 22:24:06,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:06,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737666982] [2024-06-03 22:24:06,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:06,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:13,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:13,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737666982] [2024-06-03 22:24:13,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737666982] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:13,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:13,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:24:13,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060643416] [2024-06-03 22:24:13,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:13,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:24:13,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:13,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:24:13,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:24:13,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:24:13,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 187 transitions, 1625 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:13,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:13,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:24:13,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:13,856 INFO L124 PetriNetUnfolderBase]: 389/769 cut-off events. [2024-06-03 22:24:13,856 INFO L125 PetriNetUnfolderBase]: For 32391/32391 co-relation queries the response was YES. [2024-06-03 22:24:13,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4106 conditions, 769 events. 389/769 cut-off events. For 32391/32391 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4072 event pairs, 40 based on Foata normal form. 2/769 useless extension candidates. Maximal degree in co-relation 4012. Up to 586 conditions per place. [2024-06-03 22:24:13,862 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 136 selfloop transitions, 64 changer transitions 0/204 dead transitions. [2024-06-03 22:24:13,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 204 transitions, 2122 flow [2024-06-03 22:24:13,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:13,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-03 22:24:13,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 22:24:13,864 INFO L175 Difference]: Start difference. First operand has 212 places, 187 transitions, 1625 flow. Second operand 10 states and 132 transitions. [2024-06-03 22:24:13,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 204 transitions, 2122 flow [2024-06-03 22:24:13,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 204 transitions, 2025 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-03 22:24:13,938 INFO L231 Difference]: Finished difference. Result has 215 places, 192 transitions, 1732 flow [2024-06-03 22:24:13,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1538, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1732, PETRI_PLACES=215, PETRI_TRANSITIONS=192} [2024-06-03 22:24:13,938 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 183 predicate places. [2024-06-03 22:24:13,938 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 192 transitions, 1732 flow [2024-06-03 22:24:13,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:13,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:13,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:13,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-03 22:24:13,939 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-03 22:24:13,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:13,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2006907308, now seen corresponding path program 5 times [2024-06-03 22:24:13,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:13,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625432280] [2024-06-03 22:24:13,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:13,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:20,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:20,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:20,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625432280] [2024-06-03 22:24:20,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625432280] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:20,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:20,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:24:20,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932373103] [2024-06-03 22:24:20,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:20,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:24:20,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:20,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:24:20,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:24:20,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 22:24:20,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 192 transitions, 1732 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:20,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:20,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 22:24:20,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:20,439 INFO L124 PetriNetUnfolderBase]: 393/778 cut-off events. [2024-06-03 22:24:20,439 INFO L125 PetriNetUnfolderBase]: For 33301/33301 co-relation queries the response was YES. [2024-06-03 22:24:20,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4206 conditions, 778 events. 393/778 cut-off events. For 33301/33301 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4146 event pairs, 43 based on Foata normal form. 2/778 useless extension candidates. Maximal degree in co-relation 4111. Up to 637 conditions per place. [2024-06-03 22:24:20,445 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 162 selfloop transitions, 39 changer transitions 0/205 dead transitions. [2024-06-03 22:24:20,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 205 transitions, 2176 flow [2024-06-03 22:24:20,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2024-06-03 22:24:20,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4303030303030303 [2024-06-03 22:24:20,446 INFO L175 Difference]: Start difference. First operand has 215 places, 192 transitions, 1732 flow. Second operand 10 states and 142 transitions. [2024-06-03 22:24:20,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 205 transitions, 2176 flow [2024-06-03 22:24:20,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 205 transitions, 2074 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:24:20,529 INFO L231 Difference]: Finished difference. Result has 219 places, 193 transitions, 1729 flow [2024-06-03 22:24:20,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1729, PETRI_PLACES=219, PETRI_TRANSITIONS=193} [2024-06-03 22:24:20,529 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 187 predicate places. [2024-06-03 22:24:20,530 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 193 transitions, 1729 flow [2024-06-03 22:24:20,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:20,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:20,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:20,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-03 22:24:20,530 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-03 22:24:20,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:20,530 INFO L85 PathProgramCache]: Analyzing trace with hash -340762628, now seen corresponding path program 6 times [2024-06-03 22:24:20,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:20,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24060904] [2024-06-03 22:24:20,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:20,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:27,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:27,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:27,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24060904] [2024-06-03 22:24:27,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24060904] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:27,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:27,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:24:27,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349983872] [2024-06-03 22:24:27,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:27,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:24:27,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:27,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:24:27,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:24:27,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:24:27,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 193 transitions, 1729 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:27,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:27,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:24:27,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:27,737 INFO L124 PetriNetUnfolderBase]: 390/773 cut-off events. [2024-06-03 22:24:27,737 INFO L125 PetriNetUnfolderBase]: For 30317/30317 co-relation queries the response was YES. [2024-06-03 22:24:27,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4043 conditions, 773 events. 390/773 cut-off events. For 30317/30317 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4128 event pairs, 42 based on Foata normal form. 2/773 useless extension candidates. Maximal degree in co-relation 3947. Up to 608 conditions per place. [2024-06-03 22:24:27,743 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 162 selfloop transitions, 40 changer transitions 0/206 dead transitions. [2024-06-03 22:24:27,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 206 transitions, 2163 flow [2024-06-03 22:24:27,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:27,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:27,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-03 22:24:27,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-03 22:24:27,746 INFO L175 Difference]: Start difference. First operand has 219 places, 193 transitions, 1729 flow. Second operand 10 states and 133 transitions. [2024-06-03 22:24:27,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 206 transitions, 2163 flow [2024-06-03 22:24:27,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 206 transitions, 2017 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-03 22:24:27,826 INFO L231 Difference]: Finished difference. Result has 219 places, 193 transitions, 1667 flow [2024-06-03 22:24:27,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1583, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1667, PETRI_PLACES=219, PETRI_TRANSITIONS=193} [2024-06-03 22:24:27,827 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 187 predicate places. [2024-06-03 22:24:27,827 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 193 transitions, 1667 flow [2024-06-03 22:24:27,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:27,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:27,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:27,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-03 22:24:27,827 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-03 22:24:27,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:27,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1792190358, now seen corresponding path program 7 times [2024-06-03 22:24:27,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:27,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993920212] [2024-06-03 22:24:27,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:27,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:36,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:36,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:36,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993920212] [2024-06-03 22:24:36,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993920212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:36,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:36,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:24:36,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896776493] [2024-06-03 22:24:36,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:36,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:24:36,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:36,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:24:36,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:24:36,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:24:36,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 193 transitions, 1667 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:36,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:36,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:24:36,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:36,588 INFO L124 PetriNetUnfolderBase]: 401/794 cut-off events. [2024-06-03 22:24:36,588 INFO L125 PetriNetUnfolderBase]: For 35170/35170 co-relation queries the response was YES. [2024-06-03 22:24:36,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4237 conditions, 794 events. 401/794 cut-off events. For 35170/35170 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4255 event pairs, 41 based on Foata normal form. 2/794 useless extension candidates. Maximal degree in co-relation 4140. Up to 619 conditions per place. [2024-06-03 22:24:36,594 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 175 selfloop transitions, 33 changer transitions 0/212 dead transitions. [2024-06-03 22:24:36,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 212 transitions, 2279 flow [2024-06-03 22:24:36,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:36,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:36,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-03 22:24:36,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-06-03 22:24:36,595 INFO L175 Difference]: Start difference. First operand has 219 places, 193 transitions, 1667 flow. Second operand 10 states and 136 transitions. [2024-06-03 22:24:36,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 212 transitions, 2279 flow [2024-06-03 22:24:36,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 212 transitions, 2175 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-03 22:24:36,683 INFO L231 Difference]: Finished difference. Result has 220 places, 195 transitions, 1663 flow [2024-06-03 22:24:36,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1563, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1663, PETRI_PLACES=220, PETRI_TRANSITIONS=195} [2024-06-03 22:24:36,684 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 188 predicate places. [2024-06-03 22:24:36,684 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 195 transitions, 1663 flow [2024-06-03 22:24:36,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:36,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:36,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:36,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-03 22:24:36,684 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-03 22:24:36,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:36,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1796951958, now seen corresponding path program 8 times [2024-06-03 22:24:36,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:36,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911415928] [2024-06-03 22:24:36,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:36,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:44,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:44,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911415928] [2024-06-03 22:24:44,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911415928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:44,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:44,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:24:44,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044065579] [2024-06-03 22:24:44,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:44,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:24:44,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:44,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:24:44,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:24:44,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:24:44,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 195 transitions, 1663 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:44,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:44,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:24:44,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:44,568 INFO L124 PetriNetUnfolderBase]: 405/802 cut-off events. [2024-06-03 22:24:44,568 INFO L125 PetriNetUnfolderBase]: For 36243/36243 co-relation queries the response was YES. [2024-06-03 22:24:44,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4258 conditions, 802 events. 405/802 cut-off events. For 36243/36243 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4306 event pairs, 47 based on Foata normal form. 2/802 useless extension candidates. Maximal degree in co-relation 4160. Up to 670 conditions per place. [2024-06-03 22:24:44,574 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 170 selfloop transitions, 36 changer transitions 0/210 dead transitions. [2024-06-03 22:24:44,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 210 transitions, 2125 flow [2024-06-03 22:24:44,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:44,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-03 22:24:44,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396969696969697 [2024-06-03 22:24:44,575 INFO L175 Difference]: Start difference. First operand has 220 places, 195 transitions, 1663 flow. Second operand 10 states and 131 transitions. [2024-06-03 22:24:44,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 210 transitions, 2125 flow [2024-06-03 22:24:44,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 210 transitions, 2065 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-03 22:24:44,656 INFO L231 Difference]: Finished difference. Result has 224 places, 196 transitions, 1699 flow [2024-06-03 22:24:44,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1607, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1699, PETRI_PLACES=224, PETRI_TRANSITIONS=196} [2024-06-03 22:24:44,657 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 192 predicate places. [2024-06-03 22:24:44,657 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 196 transitions, 1699 flow [2024-06-03 22:24:44,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:44,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:44,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:44,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-03 22:24:44,657 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-03 22:24:44,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:44,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1792305678, now seen corresponding path program 9 times [2024-06-03 22:24:44,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:44,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074969076] [2024-06-03 22:24:44,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:44,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:51,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-03 22:24:51,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:51,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074969076] [2024-06-03 22:24:51,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074969076] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:51,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:51,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:24:51,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181627773] [2024-06-03 22:24:51,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:51,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:24:51,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:51,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:24:51,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:24:51,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:24:51,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 196 transitions, 1699 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:51,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:51,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:24:51,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:52,296 INFO L124 PetriNetUnfolderBase]: 402/797 cut-off events. [2024-06-03 22:24:52,296 INFO L125 PetriNetUnfolderBase]: For 32833/32833 co-relation queries the response was YES. [2024-06-03 22:24:52,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4140 conditions, 797 events. 402/797 cut-off events. For 32833/32833 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4292 event pairs, 44 based on Foata normal form. 2/797 useless extension candidates. Maximal degree in co-relation 4040. Up to 647 conditions per place. [2024-06-03 22:24:52,306 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 172 selfloop transitions, 35 changer transitions 0/211 dead transitions. [2024-06-03 22:24:52,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 211 transitions, 2149 flow [2024-06-03 22:24:52,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-03 22:24:52,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-03 22:24:52,307 INFO L175 Difference]: Start difference. First operand has 224 places, 196 transitions, 1699 flow. Second operand 10 states and 133 transitions. [2024-06-03 22:24:52,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 211 transitions, 2149 flow [2024-06-03 22:24:52,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 211 transitions, 2065 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-03 22:24:52,390 INFO L231 Difference]: Finished difference. Result has 226 places, 196 transitions, 1689 flow [2024-06-03 22:24:52,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1615, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1689, PETRI_PLACES=226, PETRI_TRANSITIONS=196} [2024-06-03 22:24:52,391 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 194 predicate places. [2024-06-03 22:24:52,391 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 196 transitions, 1689 flow [2024-06-03 22:24:52,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:52,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:52,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:52,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-03 22:24:52,391 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-03 22:24:52,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:52,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1646765862, now seen corresponding path program 10 times [2024-06-03 22:24:52,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:52,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062779450] [2024-06-03 22:24:52,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:52,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:59,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:59,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:59,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062779450] [2024-06-03 22:24:59,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062779450] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:59,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:59,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:24:59,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889391621] [2024-06-03 22:24:59,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:59,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:24:59,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:59,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:24:59,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:24:59,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:24:59,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 196 transitions, 1689 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:59,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:59,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:24:59,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:00,141 INFO L124 PetriNetUnfolderBase]: 406/805 cut-off events. [2024-06-03 22:25:00,141 INFO L125 PetriNetUnfolderBase]: For 33896/33896 co-relation queries the response was YES. [2024-06-03 22:25:00,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4178 conditions, 805 events. 406/805 cut-off events. For 33896/33896 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4349 event pairs, 43 based on Foata normal form. 2/805 useless extension candidates. Maximal degree in co-relation 4077. Up to 662 conditions per place. [2024-06-03 22:25:00,147 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 189 selfloop transitions, 21 changer transitions 0/214 dead transitions. [2024-06-03 22:25:00,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 214 transitions, 2165 flow [2024-06-03 22:25:00,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:00,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-03 22:25:00,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-03 22:25:00,148 INFO L175 Difference]: Start difference. First operand has 226 places, 196 transitions, 1689 flow. Second operand 10 states and 130 transitions. [2024-06-03 22:25:00,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 214 transitions, 2165 flow [2024-06-03 22:25:00,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 214 transitions, 2083 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-03 22:25:00,237 INFO L231 Difference]: Finished difference. Result has 227 places, 197 transitions, 1671 flow [2024-06-03 22:25:00,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1607, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1671, PETRI_PLACES=227, PETRI_TRANSITIONS=197} [2024-06-03 22:25:00,238 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 195 predicate places. [2024-06-03 22:25:00,238 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 197 transitions, 1671 flow [2024-06-03 22:25:00,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:00,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:00,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:00,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-03 22:25:00,238 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-03 22:25:00,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:00,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1188041398, now seen corresponding path program 1 times [2024-06-03 22:25:00,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:00,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356696572] [2024-06-03 22:25:00,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:00,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:08,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:08,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356696572] [2024-06-03 22:25:08,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356696572] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:08,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:08,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:25:08,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800762632] [2024-06-03 22:25:08,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:08,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:25:08,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:08,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:25:08,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:25:08,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:25:08,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 197 transitions, 1671 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:08,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:08,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:25:08,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:08,747 INFO L124 PetriNetUnfolderBase]: 415/819 cut-off events. [2024-06-03 22:25:08,747 INFO L125 PetriNetUnfolderBase]: For 32935/32935 co-relation queries the response was YES. [2024-06-03 22:25:08,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4265 conditions, 819 events. 415/819 cut-off events. For 32935/32935 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4440 event pairs, 46 based on Foata normal form. 1/818 useless extension candidates. Maximal degree in co-relation 4163. Up to 604 conditions per place. [2024-06-03 22:25:08,753 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 150 selfloop transitions, 63 changer transitions 0/217 dead transitions. [2024-06-03 22:25:08,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 217 transitions, 2239 flow [2024-06-03 22:25:08,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:25:08,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:25:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-03 22:25:08,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-03 22:25:08,754 INFO L175 Difference]: Start difference. First operand has 227 places, 197 transitions, 1671 flow. Second operand 11 states and 147 transitions. [2024-06-03 22:25:08,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 217 transitions, 2239 flow [2024-06-03 22:25:08,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 217 transitions, 2185 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-03 22:25:08,836 INFO L231 Difference]: Finished difference. Result has 231 places, 205 transitions, 1897 flow [2024-06-03 22:25:08,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1617, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1897, PETRI_PLACES=231, PETRI_TRANSITIONS=205} [2024-06-03 22:25:08,836 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 199 predicate places. [2024-06-03 22:25:08,836 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 205 transitions, 1897 flow [2024-06-03 22:25:08,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:08,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:08,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:08,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-03 22:25:08,837 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-03 22:25:08,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:08,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1217281594, now seen corresponding path program 2 times [2024-06-03 22:25:08,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:08,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935286364] [2024-06-03 22:25:08,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:08,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:17,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:17,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935286364] [2024-06-03 22:25:17,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935286364] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:17,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:17,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:25:17,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535823464] [2024-06-03 22:25:17,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:17,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:25:17,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:17,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:25:17,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:25:17,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:25:17,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 205 transitions, 1897 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:17,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:17,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:25:17,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:18,065 INFO L124 PetriNetUnfolderBase]: 430/851 cut-off events. [2024-06-03 22:25:18,065 INFO L125 PetriNetUnfolderBase]: For 34503/34503 co-relation queries the response was YES. [2024-06-03 22:25:18,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4605 conditions, 851 events. 430/851 cut-off events. For 34503/34503 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4657 event pairs, 49 based on Foata normal form. 1/850 useless extension candidates. Maximal degree in co-relation 4501. Up to 677 conditions per place. [2024-06-03 22:25:18,072 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 167 selfloop transitions, 56 changer transitions 0/227 dead transitions. [2024-06-03 22:25:18,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 227 transitions, 2525 flow [2024-06-03 22:25:18,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:25:18,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:25:18,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-03 22:25:18,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39669421487603307 [2024-06-03 22:25:18,073 INFO L175 Difference]: Start difference. First operand has 231 places, 205 transitions, 1897 flow. Second operand 11 states and 144 transitions. [2024-06-03 22:25:18,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 227 transitions, 2525 flow [2024-06-03 22:25:18,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 227 transitions, 2338 flow, removed 32 selfloop flow, removed 8 redundant places. [2024-06-03 22:25:18,151 INFO L231 Difference]: Finished difference. Result has 234 places, 215 transitions, 1986 flow [2024-06-03 22:25:18,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1986, PETRI_PLACES=234, PETRI_TRANSITIONS=215} [2024-06-03 22:25:18,152 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 202 predicate places. [2024-06-03 22:25:18,152 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 215 transitions, 1986 flow [2024-06-03 22:25:18,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:18,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:18,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:18,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-03 22:25:18,152 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-03 22:25:18,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:18,153 INFO L85 PathProgramCache]: Analyzing trace with hash -987065674, now seen corresponding path program 3 times [2024-06-03 22:25:18,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:18,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296001220] [2024-06-03 22:25:18,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:18,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:25,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:25,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296001220] [2024-06-03 22:25:25,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296001220] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:25,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:25,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:25:25,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642272119] [2024-06-03 22:25:25,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:25,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:25:25,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:25,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:25:25,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:25:25,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:25:25,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 215 transitions, 1986 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:25,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:25,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:25:25,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:26,404 INFO L124 PetriNetUnfolderBase]: 438/864 cut-off events. [2024-06-03 22:25:26,405 INFO L125 PetriNetUnfolderBase]: For 38766/38766 co-relation queries the response was YES. [2024-06-03 22:25:26,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4792 conditions, 864 events. 438/864 cut-off events. For 38766/38766 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4740 event pairs, 49 based on Foata normal form. 1/863 useless extension candidates. Maximal degree in co-relation 4688. Up to 667 conditions per place. [2024-06-03 22:25:26,412 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 160 selfloop transitions, 68 changer transitions 0/232 dead transitions. [2024-06-03 22:25:26,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 232 transitions, 2728 flow [2024-06-03 22:25:26,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:25:26,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:25:26,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-03 22:25:26,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2024-06-03 22:25:26,413 INFO L175 Difference]: Start difference. First operand has 234 places, 215 transitions, 1986 flow. Second operand 11 states and 145 transitions. [2024-06-03 22:25:26,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 232 transitions, 2728 flow [2024-06-03 22:25:26,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 232 transitions, 2516 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-03 22:25:26,498 INFO L231 Difference]: Finished difference. Result has 237 places, 219 transitions, 2035 flow [2024-06-03 22:25:26,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1774, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2035, PETRI_PLACES=237, PETRI_TRANSITIONS=219} [2024-06-03 22:25:26,498 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 205 predicate places. [2024-06-03 22:25:26,498 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 219 transitions, 2035 flow [2024-06-03 22:25:26,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:26,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:26,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:26,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-03 22:25:26,499 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-03 22:25:26,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:26,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1612751720, now seen corresponding path program 4 times [2024-06-03 22:25:26,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:26,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242732567] [2024-06-03 22:25:26,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:26,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:34,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:34,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:34,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242732567] [2024-06-03 22:25:34,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242732567] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:34,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:34,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:25:34,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388139753] [2024-06-03 22:25:34,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:34,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:25:34,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:34,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:25:34,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:25:34,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:25:34,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 219 transitions, 2035 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:34,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:34,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:25:34,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:34,669 INFO L124 PetriNetUnfolderBase]: 441/869 cut-off events. [2024-06-03 22:25:34,669 INFO L125 PetriNetUnfolderBase]: For 39718/39718 co-relation queries the response was YES. [2024-06-03 22:25:34,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4859 conditions, 869 events. 441/869 cut-off events. For 39718/39718 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4790 event pairs, 49 based on Foata normal form. 1/868 useless extension candidates. Maximal degree in co-relation 4754. Up to 695 conditions per place. [2024-06-03 22:25:34,676 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 168 selfloop transitions, 61 changer transitions 0/233 dead transitions. [2024-06-03 22:25:34,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 233 transitions, 2583 flow [2024-06-03 22:25:34,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:25:34,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:25:34,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2024-06-03 22:25:34,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-03 22:25:34,677 INFO L175 Difference]: Start difference. First operand has 237 places, 219 transitions, 2035 flow. Second operand 11 states and 143 transitions. [2024-06-03 22:25:34,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 233 transitions, 2583 flow [2024-06-03 22:25:34,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 233 transitions, 2462 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-03 22:25:34,767 INFO L231 Difference]: Finished difference. Result has 242 places, 221 transitions, 2108 flow [2024-06-03 22:25:34,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1920, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2108, PETRI_PLACES=242, PETRI_TRANSITIONS=221} [2024-06-03 22:25:34,768 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 210 predicate places. [2024-06-03 22:25:34,768 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 221 transitions, 2108 flow [2024-06-03 22:25:34,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:34,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:34,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:34,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-03 22:25:34,768 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-03 22:25:34,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:34,768 INFO L85 PathProgramCache]: Analyzing trace with hash -183144052, now seen corresponding path program 5 times [2024-06-03 22:25:34,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:34,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856208585] [2024-06-03 22:25:34,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:34,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:42,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:42,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:42,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856208585] [2024-06-03 22:25:42,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856208585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:42,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:42,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:25:42,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573004537] [2024-06-03 22:25:42,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:42,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:25:42,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:42,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:25:42,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:25:42,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:25:42,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 221 transitions, 2108 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:42,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:42,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:25:42,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:42,903 INFO L124 PetriNetUnfolderBase]: 439/866 cut-off events. [2024-06-03 22:25:42,903 INFO L125 PetriNetUnfolderBase]: For 37788/37788 co-relation queries the response was YES. [2024-06-03 22:25:42,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4804 conditions, 866 events. 439/866 cut-off events. For 37788/37788 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4767 event pairs, 49 based on Foata normal form. 1/865 useless extension candidates. Maximal degree in co-relation 4697. Up to 692 conditions per place. [2024-06-03 22:25:42,910 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 176 selfloop transitions, 53 changer transitions 0/233 dead transitions. [2024-06-03 22:25:42,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 233 transitions, 2594 flow [2024-06-03 22:25:42,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:25:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:25:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-03 22:25:42,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2024-06-03 22:25:42,911 INFO L175 Difference]: Start difference. First operand has 242 places, 221 transitions, 2108 flow. Second operand 11 states and 145 transitions. [2024-06-03 22:25:42,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 233 transitions, 2594 flow [2024-06-03 22:25:42,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 233 transitions, 2382 flow, removed 43 selfloop flow, removed 9 redundant places. [2024-06-03 22:25:42,992 INFO L231 Difference]: Finished difference. Result has 244 places, 221 transitions, 2008 flow [2024-06-03 22:25:42,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1896, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2008, PETRI_PLACES=244, PETRI_TRANSITIONS=221} [2024-06-03 22:25:42,992 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 212 predicate places. [2024-06-03 22:25:42,992 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 221 transitions, 2008 flow [2024-06-03 22:25:42,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:42,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:42,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:42,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-03 22:25:42,993 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-03 22:25:42,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:42,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1796958902, now seen corresponding path program 6 times [2024-06-03 22:25:42,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:42,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377540388] [2024-06-03 22:25:42,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:42,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:49,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:49,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377540388] [2024-06-03 22:25:49,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377540388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:49,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:49,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:25:49,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341631994] [2024-06-03 22:25:49,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:49,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:25:49,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:49,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:25:49,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:25:50,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:25:50,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 221 transitions, 2008 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:50,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:50,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:25:50,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:50,478 INFO L124 PetriNetUnfolderBase]: 442/871 cut-off events. [2024-06-03 22:25:50,478 INFO L125 PetriNetUnfolderBase]: For 38450/38450 co-relation queries the response was YES. [2024-06-03 22:25:50,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4792 conditions, 871 events. 442/871 cut-off events. For 38450/38450 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4786 event pairs, 44 based on Foata normal form. 1/870 useless extension candidates. Maximal degree in co-relation 4684. Up to 726 conditions per place. [2024-06-03 22:25:50,486 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 188 selfloop transitions, 45 changer transitions 0/237 dead transitions. [2024-06-03 22:25:50,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 237 transitions, 2570 flow [2024-06-03 22:25:50,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:25:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:25:50,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-03 22:25:50,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39118457300275483 [2024-06-03 22:25:50,488 INFO L175 Difference]: Start difference. First operand has 244 places, 221 transitions, 2008 flow. Second operand 11 states and 142 transitions. [2024-06-03 22:25:50,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 237 transitions, 2570 flow [2024-06-03 22:25:50,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 237 transitions, 2369 flow, removed 7 selfloop flow, removed 12 redundant places. [2024-06-03 22:25:50,602 INFO L231 Difference]: Finished difference. Result has 243 places, 223 transitions, 1972 flow [2024-06-03 22:25:50,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1807, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1972, PETRI_PLACES=243, PETRI_TRANSITIONS=223} [2024-06-03 22:25:50,602 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 211 predicate places. [2024-06-03 22:25:50,602 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 223 transitions, 1972 flow [2024-06-03 22:25:50,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:50,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:50,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:50,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-03 22:25:50,603 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-03 22:25:50,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:50,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1834131802, now seen corresponding path program 11 times [2024-06-03 22:25:50,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:50,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428619445] [2024-06-03 22:25:50,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:50,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:57,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:57,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428619445] [2024-06-03 22:25:57,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428619445] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:57,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:57,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:25:57,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996574247] [2024-06-03 22:25:57,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:57,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:25:57,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:57,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:25:57,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:25:58,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:25:58,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 223 transitions, 1972 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:58,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:58,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:25:58,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:58,381 INFO L124 PetriNetUnfolderBase]: 449/882 cut-off events. [2024-06-03 22:25:58,381 INFO L125 PetriNetUnfolderBase]: For 41419/41419 co-relation queries the response was YES. [2024-06-03 22:25:58,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4815 conditions, 882 events. 449/882 cut-off events. For 41419/41419 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 4872 event pairs, 52 based on Foata normal form. 2/878 useless extension candidates. Maximal degree in co-relation 4706. Up to 684 conditions per place. [2024-06-03 22:25:58,388 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 178 selfloop transitions, 54 changer transitions 0/236 dead transitions. [2024-06-03 22:25:58,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 236 transitions, 2492 flow [2024-06-03 22:25:58,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:58,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:58,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2024-06-03 22:25:58,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-03 22:25:58,389 INFO L175 Difference]: Start difference. First operand has 243 places, 223 transitions, 1972 flow. Second operand 10 states and 135 transitions. [2024-06-03 22:25:58,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 236 transitions, 2492 flow [2024-06-03 22:25:58,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 236 transitions, 2272 flow, removed 37 selfloop flow, removed 10 redundant places. [2024-06-03 22:25:58,509 INFO L231 Difference]: Finished difference. Result has 243 places, 226 transitions, 1900 flow [2024-06-03 22:25:58,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1753, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1900, PETRI_PLACES=243, PETRI_TRANSITIONS=226} [2024-06-03 22:25:58,509 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 211 predicate places. [2024-06-03 22:25:58,509 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 226 transitions, 1900 flow [2024-06-03 22:25:58,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:58,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:58,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:58,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-03 22:25:58,510 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-03 22:25:58,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:58,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1840560892, now seen corresponding path program 12 times [2024-06-03 22:25:58,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:58,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062791499] [2024-06-03 22:25:58,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:58,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:04,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:04,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062791499] [2024-06-03 22:26:04,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062791499] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:04,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:04,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:26:04,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737497627] [2024-06-03 22:26:04,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:04,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:26:04,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:04,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:26:04,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:26:04,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 22:26:04,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 226 transitions, 1900 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:04,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:04,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 22:26:04,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:05,386 INFO L124 PetriNetUnfolderBase]: 456/899 cut-off events. [2024-06-03 22:26:05,386 INFO L125 PetriNetUnfolderBase]: For 43039/43039 co-relation queries the response was YES. [2024-06-03 22:26:05,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4788 conditions, 899 events. 456/899 cut-off events. For 43039/43039 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5036 event pairs, 52 based on Foata normal form. 2/895 useless extension candidates. Maximal degree in co-relation 4679. Up to 696 conditions per place. [2024-06-03 22:26:05,394 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 180 selfloop transitions, 55 changer transitions 0/239 dead transitions. [2024-06-03 22:26:05,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 239 transitions, 2431 flow [2024-06-03 22:26:05,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:26:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:26:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 146 transitions. [2024-06-03 22:26:05,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44242424242424244 [2024-06-03 22:26:05,395 INFO L175 Difference]: Start difference. First operand has 243 places, 226 transitions, 1900 flow. Second operand 10 states and 146 transitions. [2024-06-03 22:26:05,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 239 transitions, 2431 flow [2024-06-03 22:26:05,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 239 transitions, 2305 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-03 22:26:05,522 INFO L231 Difference]: Finished difference. Result has 246 places, 229 transitions, 1929 flow [2024-06-03 22:26:05,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1778, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1929, PETRI_PLACES=246, PETRI_TRANSITIONS=229} [2024-06-03 22:26:05,523 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 214 predicate places. [2024-06-03 22:26:05,523 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 229 transitions, 1929 flow [2024-06-03 22:26:05,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:05,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:05,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:05,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-03 22:26:05,524 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-03 22:26:05,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:05,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1849544810, now seen corresponding path program 13 times [2024-06-03 22:26:05,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:05,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358891522] [2024-06-03 22:26:05,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:05,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:12,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:12,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358891522] [2024-06-03 22:26:12,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358891522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:12,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:12,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:12,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753874341] [2024-06-03 22:26:12,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:12,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:12,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:12,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:12,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:12,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:26:12,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 229 transitions, 1929 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:12,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:12,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:26:12,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:13,061 INFO L124 PetriNetUnfolderBase]: 460/905 cut-off events. [2024-06-03 22:26:13,061 INFO L125 PetriNetUnfolderBase]: For 44170/44170 co-relation queries the response was YES. [2024-06-03 22:26:13,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4834 conditions, 905 events. 460/905 cut-off events. For 44170/44170 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5056 event pairs, 54 based on Foata normal form. 2/897 useless extension candidates. Maximal degree in co-relation 4724. Up to 661 conditions per place. [2024-06-03 22:26:13,069 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 146 selfloop transitions, 90 changer transitions 0/240 dead transitions. [2024-06-03 22:26:13,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 240 transitions, 2445 flow [2024-06-03 22:26:13,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:26:13,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:26:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-03 22:26:13,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-03 22:26:13,069 INFO L175 Difference]: Start difference. First operand has 246 places, 229 transitions, 1929 flow. Second operand 10 states and 133 transitions. [2024-06-03 22:26:13,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 240 transitions, 2445 flow [2024-06-03 22:26:13,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 240 transitions, 2328 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-03 22:26:13,193 INFO L231 Difference]: Finished difference. Result has 250 places, 230 transitions, 2020 flow [2024-06-03 22:26:13,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1812, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2020, PETRI_PLACES=250, PETRI_TRANSITIONS=230} [2024-06-03 22:26:13,193 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 218 predicate places. [2024-06-03 22:26:13,193 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 230 transitions, 2020 flow [2024-06-03 22:26:13,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:13,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:13,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:13,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-03 22:26:13,194 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-03 22:26:13,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:13,194 INFO L85 PathProgramCache]: Analyzing trace with hash 378057088, now seen corresponding path program 14 times [2024-06-03 22:26:13,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:13,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403954982] [2024-06-03 22:26:13,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:13,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:20,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:20,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:20,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403954982] [2024-06-03 22:26:20,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403954982] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:20,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:20,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:20,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121319195] [2024-06-03 22:26:20,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:20,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:20,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:20,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:20,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:20,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:26:20,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 230 transitions, 2020 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:20,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:20,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:26:20,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:20,663 INFO L124 PetriNetUnfolderBase]: 464/915 cut-off events. [2024-06-03 22:26:20,676 INFO L125 PetriNetUnfolderBase]: For 45444/45444 co-relation queries the response was YES. [2024-06-03 22:26:20,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4961 conditions, 915 events. 464/915 cut-off events. For 45444/45444 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5117 event pairs, 52 based on Foata normal form. 2/911 useless extension candidates. Maximal degree in co-relation 4850. Up to 692 conditions per place. [2024-06-03 22:26:20,684 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 181 selfloop transitions, 57 changer transitions 0/242 dead transitions. [2024-06-03 22:26:20,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 242 transitions, 2544 flow [2024-06-03 22:26:20,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:26:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:26:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-03 22:26:20,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-03 22:26:20,686 INFO L175 Difference]: Start difference. First operand has 250 places, 230 transitions, 2020 flow. Second operand 10 states and 137 transitions. [2024-06-03 22:26:20,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 242 transitions, 2544 flow [2024-06-03 22:26:20,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 242 transitions, 2329 flow, removed 12 selfloop flow, removed 10 redundant places. [2024-06-03 22:26:20,829 INFO L231 Difference]: Finished difference. Result has 250 places, 231 transitions, 1949 flow [2024-06-03 22:26:20,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1805, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1949, PETRI_PLACES=250, PETRI_TRANSITIONS=231} [2024-06-03 22:26:20,829 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 218 predicate places. [2024-06-03 22:26:20,829 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 231 transitions, 1949 flow [2024-06-03 22:26:20,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:20,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:20,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:20,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-03 22:26:20,830 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-03 22:26:20,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:20,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1850650552, now seen corresponding path program 15 times [2024-06-03 22:26:20,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:20,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100431195] [2024-06-03 22:26:20,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:20,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:27,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:27,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100431195] [2024-06-03 22:26:27,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100431195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:27,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:27,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:27,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860120233] [2024-06-03 22:26:27,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:27,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:27,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:27,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:27,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:27,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:26:27,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 231 transitions, 1949 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:27,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:27,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:26:27,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:28,133 INFO L124 PetriNetUnfolderBase]: 471/926 cut-off events. [2024-06-03 22:26:28,133 INFO L125 PetriNetUnfolderBase]: For 46745/46745 co-relation queries the response was YES. [2024-06-03 22:26:28,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4956 conditions, 926 events. 471/926 cut-off events. For 46745/46745 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5196 event pairs, 54 based on Foata normal form. 2/922 useless extension candidates. Maximal degree in co-relation 4846. Up to 724 conditions per place. [2024-06-03 22:26:28,141 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 179 selfloop transitions, 61 changer transitions 0/244 dead transitions. [2024-06-03 22:26:28,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 244 transitions, 2496 flow [2024-06-03 22:26:28,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:26:28,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:26:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-03 22:26:28,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2024-06-03 22:26:28,142 INFO L175 Difference]: Start difference. First operand has 250 places, 231 transitions, 1949 flow. Second operand 10 states and 134 transitions. [2024-06-03 22:26:28,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 244 transitions, 2496 flow [2024-06-03 22:26:28,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 244 transitions, 2358 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-03 22:26:28,269 INFO L231 Difference]: Finished difference. Result has 252 places, 234 transitions, 1984 flow [2024-06-03 22:26:28,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1815, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1984, PETRI_PLACES=252, PETRI_TRANSITIONS=234} [2024-06-03 22:26:28,270 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 220 predicate places. [2024-06-03 22:26:28,270 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 234 transitions, 1984 flow [2024-06-03 22:26:28,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:28,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:28,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:28,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-03 22:26:28,270 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-03 22:26:28,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:28,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1180514086, now seen corresponding path program 16 times [2024-06-03 22:26:28,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:28,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213174384] [2024-06-03 22:26:28,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:28,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:34,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:34,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213174384] [2024-06-03 22:26:34,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213174384] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:34,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:34,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:26:34,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132304665] [2024-06-03 22:26:34,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:34,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:26:34,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:34,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:26:34,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:26:34,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 22:26:34,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 234 transitions, 1984 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:34,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:34,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 22:26:34,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:34,975 INFO L124 PetriNetUnfolderBase]: 475/936 cut-off events. [2024-06-03 22:26:34,976 INFO L125 PetriNetUnfolderBase]: For 48069/48069 co-relation queries the response was YES. [2024-06-03 22:26:34,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5008 conditions, 936 events. 475/936 cut-off events. For 48069/48069 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5282 event pairs, 54 based on Foata normal form. 2/932 useless extension candidates. Maximal degree in co-relation 4897. Up to 732 conditions per place. [2024-06-03 22:26:34,983 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 179 selfloop transitions, 62 changer transitions 0/245 dead transitions. [2024-06-03 22:26:34,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 245 transitions, 2516 flow [2024-06-03 22:26:34,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:26:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:26:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2024-06-03 22:26:34,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-03 22:26:34,985 INFO L175 Difference]: Start difference. First operand has 252 places, 234 transitions, 1984 flow. Second operand 10 states and 143 transitions. [2024-06-03 22:26:34,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 245 transitions, 2516 flow [2024-06-03 22:26:35,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 245 transitions, 2372 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-03 22:26:35,129 INFO L231 Difference]: Finished difference. Result has 255 places, 235 transitions, 1998 flow [2024-06-03 22:26:35,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1840, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1998, PETRI_PLACES=255, PETRI_TRANSITIONS=235} [2024-06-03 22:26:35,129 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 223 predicate places. [2024-06-03 22:26:35,129 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 235 transitions, 1998 flow [2024-06-03 22:26:35,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:35,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:35,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:35,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-03 22:26:35,129 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-03 22:26:35,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:35,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1113271496, now seen corresponding path program 17 times [2024-06-03 22:26:35,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:35,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161056807] [2024-06-03 22:26:35,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:35,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:41,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-03 22:26:41,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:41,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161056807] [2024-06-03 22:26:41,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161056807] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:41,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:41,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:41,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582845959] [2024-06-03 22:26:41,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:41,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:41,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:41,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:41,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:41,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:26:41,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 235 transitions, 1998 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:41,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:41,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:26:41,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:42,335 INFO L124 PetriNetUnfolderBase]: 479/940 cut-off events. [2024-06-03 22:26:42,336 INFO L125 PetriNetUnfolderBase]: For 49288/49288 co-relation queries the response was YES. [2024-06-03 22:26:42,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5056 conditions, 940 events. 479/940 cut-off events. For 49288/49288 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5292 event pairs, 56 based on Foata normal form. 2/932 useless extension candidates. Maximal degree in co-relation 4944. Up to 697 conditions per place. [2024-06-03 22:26:42,344 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 166 selfloop transitions, 76 changer transitions 0/246 dead transitions. [2024-06-03 22:26:42,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 246 transitions, 2534 flow [2024-06-03 22:26:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:26:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:26:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2024-06-03 22:26:42,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-03 22:26:42,346 INFO L175 Difference]: Start difference. First operand has 255 places, 235 transitions, 1998 flow. Second operand 10 states and 135 transitions. [2024-06-03 22:26:42,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 246 transitions, 2534 flow [2024-06-03 22:26:42,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 246 transitions, 2378 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-03 22:26:42,494 INFO L231 Difference]: Finished difference. Result has 256 places, 236 transitions, 2030 flow [2024-06-03 22:26:42,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1842, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2030, PETRI_PLACES=256, PETRI_TRANSITIONS=236} [2024-06-03 22:26:42,494 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 224 predicate places. [2024-06-03 22:26:42,494 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 236 transitions, 2030 flow [2024-06-03 22:26:42,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:42,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:42,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:42,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-03 22:26:42,495 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-03 22:26:42,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:42,495 INFO L85 PathProgramCache]: Analyzing trace with hash 571013560, now seen corresponding path program 18 times [2024-06-03 22:26:42,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:42,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530079538] [2024-06-03 22:26:42,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:42,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:49,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:49,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:49,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530079538] [2024-06-03 22:26:49,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530079538] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:49,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:49,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:49,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579487329] [2024-06-03 22:26:49,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:49,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:49,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:49,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:49,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:49,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:26:49,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 236 transitions, 2030 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:49,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:49,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:26:49,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:50,136 INFO L124 PetriNetUnfolderBase]: 483/950 cut-off events. [2024-06-03 22:26:50,137 INFO L125 PetriNetUnfolderBase]: For 50610/50610 co-relation queries the response was YES. [2024-06-03 22:26:50,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5128 conditions, 950 events. 483/950 cut-off events. For 50610/50610 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5343 event pairs, 56 based on Foata normal form. 2/946 useless extension candidates. Maximal degree in co-relation 5016. Up to 734 conditions per place. [2024-06-03 22:26:50,145 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 183 selfloop transitions, 61 changer transitions 0/248 dead transitions. [2024-06-03 22:26:50,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 248 transitions, 2574 flow [2024-06-03 22:26:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:26:50,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:26:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-03 22:26:50,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-06-03 22:26:50,146 INFO L175 Difference]: Start difference. First operand has 256 places, 236 transitions, 2030 flow. Second operand 10 states and 136 transitions. [2024-06-03 22:26:50,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 248 transitions, 2574 flow [2024-06-03 22:26:50,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 248 transitions, 2377 flow, removed 15 selfloop flow, removed 10 redundant places. [2024-06-03 22:26:50,298 INFO L231 Difference]: Finished difference. Result has 256 places, 237 transitions, 1993 flow [2024-06-03 22:26:50,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1833, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1993, PETRI_PLACES=256, PETRI_TRANSITIONS=237} [2024-06-03 22:26:50,299 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 224 predicate places. [2024-06-03 22:26:50,299 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 237 transitions, 1993 flow [2024-06-03 22:26:50,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:50,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:50,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:50,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-03 22:26:50,299 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-03 22:26:50,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:50,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1482080968, now seen corresponding path program 19 times [2024-06-03 22:26:50,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:50,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712332544] [2024-06-03 22:26:50,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:50,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:57,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:57,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712332544] [2024-06-03 22:26:57,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712332544] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:57,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:57,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:57,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593457708] [2024-06-03 22:26:57,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:57,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:57,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:57,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:57,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:57,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:26:57,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 237 transitions, 1993 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:57,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:57,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:26:57,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:58,173 INFO L124 PetriNetUnfolderBase]: 487/958 cut-off events. [2024-06-03 22:26:58,173 INFO L125 PetriNetUnfolderBase]: For 51835/51835 co-relation queries the response was YES. [2024-06-03 22:26:58,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5136 conditions, 958 events. 487/958 cut-off events. For 51835/51835 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5433 event pairs, 56 based on Foata normal form. 2/954 useless extension candidates. Maximal degree in co-relation 5024. Up to 659 conditions per place. [2024-06-03 22:26:58,181 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 178 selfloop transitions, 69 changer transitions 0/251 dead transitions. [2024-06-03 22:26:58,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 251 transitions, 2713 flow [2024-06-03 22:26:58,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:26:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:26:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-03 22:26:58,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-03 22:26:58,182 INFO L175 Difference]: Start difference. First operand has 256 places, 237 transitions, 1993 flow. Second operand 10 states and 137 transitions. [2024-06-03 22:26:58,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 251 transitions, 2713 flow [2024-06-03 22:26:58,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 251 transitions, 2563 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-03 22:26:58,322 INFO L231 Difference]: Finished difference. Result has 258 places, 238 transitions, 2019 flow [2024-06-03 22:26:58,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1843, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2019, PETRI_PLACES=258, PETRI_TRANSITIONS=238} [2024-06-03 22:26:58,323 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 226 predicate places. [2024-06-03 22:26:58,323 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 238 transitions, 2019 flow [2024-06-03 22:26:58,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:58,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:58,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:58,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-03 22:26:58,323 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-03 22:26:58,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:58,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1180691716, now seen corresponding path program 20 times [2024-06-03 22:26:58,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:58,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724226515] [2024-06-03 22:26:58,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:58,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27: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-03 22:27:04,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:04,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724226515] [2024-06-03 22:27:04,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724226515] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:04,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:04,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:27:04,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145547947] [2024-06-03 22:27:04,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:04,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:27:04,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:04,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:27:04,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:27:05,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-03 22:27:05,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 238 transitions, 2019 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:05,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:05,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-03 22:27:05,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:05,375 INFO L124 PetriNetUnfolderBase]: 484/951 cut-off events. [2024-06-03 22:27:05,375 INFO L125 PetriNetUnfolderBase]: For 45853/45853 co-relation queries the response was YES. [2024-06-03 22:27:05,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4922 conditions, 951 events. 484/951 cut-off events. For 45853/45853 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5399 event pairs, 57 based on Foata normal form. 2/947 useless extension candidates. Maximal degree in co-relation 4809. Up to 725 conditions per place. [2024-06-03 22:27:05,383 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 180 selfloop transitions, 65 changer transitions 0/249 dead transitions. [2024-06-03 22:27:05,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 249 transitions, 2533 flow [2024-06-03 22:27:05,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:27:05,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:27:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 144 transitions. [2024-06-03 22:27:05,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2024-06-03 22:27:05,384 INFO L175 Difference]: Start difference. First operand has 258 places, 238 transitions, 2019 flow. Second operand 10 states and 144 transitions. [2024-06-03 22:27:05,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 249 transitions, 2533 flow [2024-06-03 22:27:05,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 249 transitions, 2323 flow, removed 24 selfloop flow, removed 9 redundant places. [2024-06-03 22:27:05,529 INFO L231 Difference]: Finished difference. Result has 259 places, 238 transitions, 1943 flow [2024-06-03 22:27:05,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1943, PETRI_PLACES=259, PETRI_TRANSITIONS=238} [2024-06-03 22:27:05,530 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 227 predicate places. [2024-06-03 22:27:05,530 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 238 transitions, 1943 flow [2024-06-03 22:27:05,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:05,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:05,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:05,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-03 22:27:05,530 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-03 22:27:05,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:05,531 INFO L85 PathProgramCache]: Analyzing trace with hash 998867884, now seen corresponding path program 7 times [2024-06-03 22:27:05,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:05,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894979640] [2024-06-03 22:27:05,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:05,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:12,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:12,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894979640] [2024-06-03 22:27:12,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894979640] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:12,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:12,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:27:12,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371221399] [2024-06-03 22:27:12,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:12,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:27:12,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:12,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:27:12,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:27:12,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:27:12,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 238 transitions, 1943 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:12,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:12,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:27:12,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:13,283 INFO L124 PetriNetUnfolderBase]: 490/965 cut-off events. [2024-06-03 22:27:13,284 INFO L125 PetriNetUnfolderBase]: For 43070/43070 co-relation queries the response was YES. [2024-06-03 22:27:13,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4826 conditions, 965 events. 490/965 cut-off events. For 43070/43070 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5485 event pairs, 59 based on Foata normal form. 1/960 useless extension candidates. Maximal degree in co-relation 4714. Up to 694 conditions per place. [2024-06-03 22:27:13,292 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 160 selfloop transitions, 88 changer transitions 0/252 dead transitions. [2024-06-03 22:27:13,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 252 transitions, 2539 flow [2024-06-03 22:27:13,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:27:13,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:27:13,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-03 22:27:13,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-03 22:27:13,293 INFO L175 Difference]: Start difference. First operand has 259 places, 238 transitions, 1943 flow. Second operand 11 states and 147 transitions. [2024-06-03 22:27:13,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 252 transitions, 2539 flow [2024-06-03 22:27:13,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 252 transitions, 2261 flow, removed 10 selfloop flow, removed 11 redundant places. [2024-06-03 22:27:13,424 INFO L231 Difference]: Finished difference. Result has 259 places, 242 transitions, 1928 flow [2024-06-03 22:27:13,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1667, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1928, PETRI_PLACES=259, PETRI_TRANSITIONS=242} [2024-06-03 22:27:13,424 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 227 predicate places. [2024-06-03 22:27:13,424 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 242 transitions, 1928 flow [2024-06-03 22:27:13,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:13,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:13,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:13,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-03 22:27:13,425 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-03 22:27:13,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:13,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1603908938, now seen corresponding path program 8 times [2024-06-03 22:27:13,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:13,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405068601] [2024-06-03 22:27:13,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:13,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:21,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:21,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405068601] [2024-06-03 22:27:21,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405068601] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:21,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:21,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:27:21,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519380231] [2024-06-03 22:27:21,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:21,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:27:21,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:21,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:27:21,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:27:21,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:27:21,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 242 transitions, 1928 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:21,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:21,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:27:21,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:22,117 INFO L124 PetriNetUnfolderBase]: 501/985 cut-off events. [2024-06-03 22:27:22,117 INFO L125 PetriNetUnfolderBase]: For 48339/48339 co-relation queries the response was YES. [2024-06-03 22:27:22,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4975 conditions, 985 events. 501/985 cut-off events. For 48339/48339 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5622 event pairs, 59 based on Foata normal form. 1/980 useless extension candidates. Maximal degree in co-relation 4863. Up to 702 conditions per place. [2024-06-03 22:27:22,124 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 172 selfloop transitions, 84 changer transitions 0/260 dead transitions. [2024-06-03 22:27:22,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 260 transitions, 2788 flow [2024-06-03 22:27:22,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:27:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:27:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 162 transitions. [2024-06-03 22:27:22,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-03 22:27:22,125 INFO L175 Difference]: Start difference. First operand has 259 places, 242 transitions, 1928 flow. Second operand 12 states and 162 transitions. [2024-06-03 22:27:22,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 260 transitions, 2788 flow [2024-06-03 22:27:22,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 260 transitions, 2551 flow, removed 31 selfloop flow, removed 8 redundant places. [2024-06-03 22:27:22,271 INFO L231 Difference]: Finished difference. Result has 263 places, 248 transitions, 2020 flow [2024-06-03 22:27:22,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1695, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2020, PETRI_PLACES=263, PETRI_TRANSITIONS=248} [2024-06-03 22:27:22,271 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 231 predicate places. [2024-06-03 22:27:22,271 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 248 transitions, 2020 flow [2024-06-03 22:27:22,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:22,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:22,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:22,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-03 22:27:22,272 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-03 22:27:22,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:22,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1659339402, now seen corresponding path program 9 times [2024-06-03 22:27:22,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:22,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638013489] [2024-06-03 22:27:22,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:22,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:29,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:29,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638013489] [2024-06-03 22:27:29,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638013489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:29,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:29,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:27:29,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503753696] [2024-06-03 22:27:29,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:29,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:27:29,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:29,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:27:29,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:27:29,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:27:29,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 248 transitions, 2020 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:29,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:29,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:27:29,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:30,263 INFO L124 PetriNetUnfolderBase]: 507/995 cut-off events. [2024-06-03 22:27:30,263 INFO L125 PetriNetUnfolderBase]: For 49752/49752 co-relation queries the response was YES. [2024-06-03 22:27:30,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5044 conditions, 995 events. 507/995 cut-off events. For 49752/49752 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 5705 event pairs, 59 based on Foata normal form. 1/990 useless extension candidates. Maximal degree in co-relation 4931. Up to 720 conditions per place. [2024-06-03 22:27:30,270 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 178 selfloop transitions, 80 changer transitions 0/262 dead transitions. [2024-06-03 22:27:30,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 262 transitions, 2646 flow [2024-06-03 22:27:30,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:27:30,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:27:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2024-06-03 22:27:30,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132231404958678 [2024-06-03 22:27:30,271 INFO L175 Difference]: Start difference. First operand has 263 places, 248 transitions, 2020 flow. Second operand 11 states and 150 transitions. [2024-06-03 22:27:30,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 262 transitions, 2646 flow [2024-06-03 22:27:30,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 262 transitions, 2468 flow, removed 41 selfloop flow, removed 7 redundant places. [2024-06-03 22:27:30,416 INFO L231 Difference]: Finished difference. Result has 267 places, 252 transitions, 2099 flow [2024-06-03 22:27:30,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1852, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2099, PETRI_PLACES=267, PETRI_TRANSITIONS=252} [2024-06-03 22:27:30,416 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 235 predicate places. [2024-06-03 22:27:30,417 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 252 transitions, 2099 flow [2024-06-03 22:27:30,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:30,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:30,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:30,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-03 22:27:30,417 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-03 22:27:30,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:30,417 INFO L85 PathProgramCache]: Analyzing trace with hash 83513176, now seen corresponding path program 10 times [2024-06-03 22:27:30,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:30,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633016906] [2024-06-03 22:27:30,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:30,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:38,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:38,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633016906] [2024-06-03 22:27:38,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633016906] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:38,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:38,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:27:38,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937038108] [2024-06-03 22:27:38,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:38,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:27:38,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:38,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:27:38,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:27:38,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:27:38,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 252 transitions, 2099 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:38,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:38,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:27:38,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:39,148 INFO L124 PetriNetUnfolderBase]: 515/1010 cut-off events. [2024-06-03 22:27:39,148 INFO L125 PetriNetUnfolderBase]: For 54989/54989 co-relation queries the response was YES. [2024-06-03 22:27:39,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5393 conditions, 1010 events. 515/1010 cut-off events. For 54989/54989 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 5818 event pairs, 59 based on Foata normal form. 1/1005 useless extension candidates. Maximal degree in co-relation 5278. Up to 723 conditions per place. [2024-06-03 22:27:39,157 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 166 selfloop transitions, 98 changer transitions 0/268 dead transitions. [2024-06-03 22:27:39,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 268 transitions, 2971 flow [2024-06-03 22:27:39,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:27:39,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:27:39,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 160 transitions. [2024-06-03 22:27:39,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2024-06-03 22:27:39,158 INFO L175 Difference]: Start difference. First operand has 267 places, 252 transitions, 2099 flow. Second operand 12 states and 160 transitions. [2024-06-03 22:27:39,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 268 transitions, 2971 flow [2024-06-03 22:27:39,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 268 transitions, 2769 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-03 22:27:39,315 INFO L231 Difference]: Finished difference. Result has 272 places, 256 transitions, 2246 flow [2024-06-03 22:27:39,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2246, PETRI_PLACES=272, PETRI_TRANSITIONS=256} [2024-06-03 22:27:39,316 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 240 predicate places. [2024-06-03 22:27:39,316 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 256 transitions, 2246 flow [2024-06-03 22:27:39,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:39,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:39,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:39,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-03 22:27:39,316 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-03 22:27:39,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:39,317 INFO L85 PathProgramCache]: Analyzing trace with hash -363926858, now seen corresponding path program 11 times [2024-06-03 22:27:39,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:39,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254059578] [2024-06-03 22:27:39,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:39,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:47,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-03 22:27:47,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:47,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254059578] [2024-06-03 22:27:47,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254059578] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:47,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:47,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:27:47,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151768567] [2024-06-03 22:27:47,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:47,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:27:47,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:47,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:27:47,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:27:47,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:27:47,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 256 transitions, 2246 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:47,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:47,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:27:47,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:47,562 INFO L124 PetriNetUnfolderBase]: 523/1028 cut-off events. [2024-06-03 22:27:47,562 INFO L125 PetriNetUnfolderBase]: For 61959/61959 co-relation queries the response was YES. [2024-06-03 22:27:47,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5718 conditions, 1028 events. 523/1028 cut-off events. For 61959/61959 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 5919 event pairs, 70 based on Foata normal form. 1/1027 useless extension candidates. Maximal degree in co-relation 5602. Up to 909 conditions per place. [2024-06-03 22:27:47,571 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 244 selfloop transitions, 24 changer transitions 0/272 dead transitions. [2024-06-03 22:27:47,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 272 transitions, 3136 flow [2024-06-03 22:27:47,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:27:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:27:47,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 151 transitions. [2024-06-03 22:27:47,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3813131313131313 [2024-06-03 22:27:47,572 INFO L175 Difference]: Start difference. First operand has 272 places, 256 transitions, 2246 flow. Second operand 12 states and 151 transitions. [2024-06-03 22:27:47,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 272 transitions, 3136 flow [2024-06-03 22:27:47,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 272 transitions, 2938 flow, removed 40 selfloop flow, removed 8 redundant places. [2024-06-03 22:27:47,725 INFO L231 Difference]: Finished difference. Result has 276 places, 260 transitions, 2257 flow [2024-06-03 22:27:47,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2257, PETRI_PLACES=276, PETRI_TRANSITIONS=260} [2024-06-03 22:27:47,726 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 244 predicate places. [2024-06-03 22:27:47,726 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 260 transitions, 2257 flow [2024-06-03 22:27:47,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:47,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:47,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:47,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-03 22:27:47,726 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-03 22:27:47,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:47,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1604205608, now seen corresponding path program 12 times [2024-06-03 22:27:47,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:47,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757059348] [2024-06-03 22:27:47,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:47,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:54,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:54,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757059348] [2024-06-03 22:27:54,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757059348] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:54,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:54,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:27:54,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003591927] [2024-06-03 22:27:54,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:54,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:27:54,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:54,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:27:54,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:27:55,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:27:55,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 260 transitions, 2257 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:55,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:55,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:27:55,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:55,638 INFO L124 PetriNetUnfolderBase]: 526/1032 cut-off events. [2024-06-03 22:27:55,638 INFO L125 PetriNetUnfolderBase]: For 62281/62281 co-relation queries the response was YES. [2024-06-03 22:27:55,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5736 conditions, 1032 events. 526/1032 cut-off events. For 62281/62281 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 5971 event pairs, 59 based on Foata normal form. 1/1027 useless extension candidates. Maximal degree in co-relation 5618. Up to 751 conditions per place. [2024-06-03 22:27:55,647 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 186 selfloop transitions, 82 changer transitions 0/272 dead transitions. [2024-06-03 22:27:55,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 272 transitions, 2883 flow [2024-06-03 22:27:55,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:27:55,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:27:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-03 22:27:55,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41046831955922863 [2024-06-03 22:27:55,648 INFO L175 Difference]: Start difference. First operand has 276 places, 260 transitions, 2257 flow. Second operand 11 states and 149 transitions. [2024-06-03 22:27:55,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 272 transitions, 2883 flow [2024-06-03 22:27:55,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 272 transitions, 2771 flow, removed 44 selfloop flow, removed 8 redundant places. [2024-06-03 22:27:55,826 INFO L231 Difference]: Finished difference. Result has 279 places, 262 transitions, 2386 flow [2024-06-03 22:27:55,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2386, PETRI_PLACES=279, PETRI_TRANSITIONS=262} [2024-06-03 22:27:55,827 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 247 predicate places. [2024-06-03 22:27:55,827 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 262 transitions, 2386 flow [2024-06-03 22:27:55,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:55,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:55,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:55,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-03 22:27:55,828 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-03 22:27:55,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:55,828 INFO L85 PathProgramCache]: Analyzing trace with hash 737431914, now seen corresponding path program 13 times [2024-06-03 22:27:55,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:55,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599607361] [2024-06-03 22:27:55,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:55,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:03,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:03,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599607361] [2024-06-03 22:28:03,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599607361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:03,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:03,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:03,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999540250] [2024-06-03 22:28:03,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:03,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:03,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:03,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:03,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:03,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:28:03,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 262 transitions, 2386 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:03,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:03,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:28:03,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:03,759 INFO L124 PetriNetUnfolderBase]: 532/1042 cut-off events. [2024-06-03 22:28:03,759 INFO L125 PetriNetUnfolderBase]: For 63394/63394 co-relation queries the response was YES. [2024-06-03 22:28:03,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5926 conditions, 1042 events. 532/1042 cut-off events. For 63394/63394 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6000 event pairs, 59 based on Foata normal form. 1/1037 useless extension candidates. Maximal degree in co-relation 5806. Up to 760 conditions per place. [2024-06-03 22:28:03,768 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 191 selfloop transitions, 81 changer transitions 0/276 dead transitions. [2024-06-03 22:28:03,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 276 transitions, 3046 flow [2024-06-03 22:28:03,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:28:03,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:28:03,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2024-06-03 22:28:03,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41597796143250687 [2024-06-03 22:28:03,769 INFO L175 Difference]: Start difference. First operand has 279 places, 262 transitions, 2386 flow. Second operand 11 states and 151 transitions. [2024-06-03 22:28:03,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 276 transitions, 3046 flow [2024-06-03 22:28:03,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 276 transitions, 2821 flow, removed 30 selfloop flow, removed 9 redundant places. [2024-06-03 22:28:03,957 INFO L231 Difference]: Finished difference. Result has 281 places, 266 transitions, 2426 flow [2024-06-03 22:28:03,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2165, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2426, PETRI_PLACES=281, PETRI_TRANSITIONS=266} [2024-06-03 22:28:03,957 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 249 predicate places. [2024-06-03 22:28:03,957 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 266 transitions, 2426 flow [2024-06-03 22:28:03,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:03,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:03,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:03,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-03 22:28:03,957 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-03 22:28:03,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:03,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1486849512, now seen corresponding path program 14 times [2024-06-03 22:28:03,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:03,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781723130] [2024-06-03 22:28:03,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:03,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:12,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:12,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:12,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781723130] [2024-06-03 22:28:12,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781723130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:12,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:12,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:12,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890809870] [2024-06-03 22:28:12,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:12,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:12,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:12,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:12,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:12,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:28:12,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 266 transitions, 2426 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:12,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:12,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:28:12,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:13,239 INFO L124 PetriNetUnfolderBase]: 530/1037 cut-off events. [2024-06-03 22:28:13,240 INFO L125 PetriNetUnfolderBase]: For 60066/60066 co-relation queries the response was YES. [2024-06-03 22:28:13,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5752 conditions, 1037 events. 530/1037 cut-off events. For 60066/60066 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6013 event pairs, 59 based on Foata normal form. 1/1032 useless extension candidates. Maximal degree in co-relation 5631. Up to 757 conditions per place. [2024-06-03 22:28:13,249 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 185 selfloop transitions, 87 changer transitions 0/276 dead transitions. [2024-06-03 22:28:13,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 276 transitions, 2992 flow [2024-06-03 22:28:13,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:28:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:28:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2024-06-03 22:28:13,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40771349862258954 [2024-06-03 22:28:13,250 INFO L175 Difference]: Start difference. First operand has 281 places, 266 transitions, 2426 flow. Second operand 11 states and 148 transitions. [2024-06-03 22:28:13,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 276 transitions, 2992 flow [2024-06-03 22:28:13,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 276 transitions, 2726 flow, removed 60 selfloop flow, removed 7 redundant places. [2024-06-03 22:28:13,442 INFO L231 Difference]: Finished difference. Result has 285 places, 266 transitions, 2339 flow [2024-06-03 22:28:13,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2160, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2339, PETRI_PLACES=285, PETRI_TRANSITIONS=266} [2024-06-03 22:28:13,443 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 253 predicate places. [2024-06-03 22:28:13,443 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 266 transitions, 2339 flow [2024-06-03 22:28:13,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:13,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:13,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:13,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-03 22:28:13,443 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-03 22:28:13,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:13,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1849537866, now seen corresponding path program 15 times [2024-06-03 22:28:13,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:13,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742404904] [2024-06-03 22:28:13,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:13,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:21,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:21,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742404904] [2024-06-03 22:28:21,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742404904] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:21,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:21,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:21,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494841722] [2024-06-03 22:28:21,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:21,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:21,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:21,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:21,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:21,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:28:21,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 266 transitions, 2339 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:21,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:21,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:28:21,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:22,020 INFO L124 PetriNetUnfolderBase]: 528/1036 cut-off events. [2024-06-03 22:28:22,020 INFO L125 PetriNetUnfolderBase]: For 56265/56265 co-relation queries the response was YES. [2024-06-03 22:28:22,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5544 conditions, 1036 events. 528/1036 cut-off events. For 56265/56265 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 5991 event pairs, 59 based on Foata normal form. 1/1031 useless extension candidates. Maximal degree in co-relation 5422. Up to 754 conditions per place. [2024-06-03 22:28:22,030 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 177 selfloop transitions, 95 changer transitions 0/276 dead transitions. [2024-06-03 22:28:22,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 276 transitions, 2905 flow [2024-06-03 22:28:22,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:28:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:28:22,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-03 22:28:22,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-03 22:28:22,031 INFO L175 Difference]: Start difference. First operand has 285 places, 266 transitions, 2339 flow. Second operand 11 states and 146 transitions. [2024-06-03 22:28:22,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 276 transitions, 2905 flow [2024-06-03 22:28:22,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 276 transitions, 2632 flow, removed 35 selfloop flow, removed 13 redundant places. [2024-06-03 22:28:22,242 INFO L231 Difference]: Finished difference. Result has 283 places, 266 transitions, 2261 flow [2024-06-03 22:28:22,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2066, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2261, PETRI_PLACES=283, PETRI_TRANSITIONS=266} [2024-06-03 22:28:22,242 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 251 predicate places. [2024-06-03 22:28:22,242 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 266 transitions, 2261 flow [2024-06-03 22:28:22,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:22,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:22,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:22,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-03 22:28:22,243 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-03 22:28:22,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:22,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1090924, now seen corresponding path program 16 times [2024-06-03 22:28:22,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:22,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913398345] [2024-06-03 22:28:22,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:22,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:32,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:32,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913398345] [2024-06-03 22:28:32,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913398345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:32,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:32,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:32,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81980510] [2024-06-03 22:28:32,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:32,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:32,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:32,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:32,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:32,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:28:32,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 266 transitions, 2261 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:32,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:32,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:28:32,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:33,264 INFO L124 PetriNetUnfolderBase]: 526/1032 cut-off events. [2024-06-03 22:28:33,264 INFO L125 PetriNetUnfolderBase]: For 52615/52615 co-relation queries the response was YES. [2024-06-03 22:28:33,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5345 conditions, 1032 events. 526/1032 cut-off events. For 52615/52615 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 5946 event pairs, 76 based on Foata normal form. 1/1031 useless extension candidates. Maximal degree in co-relation 5224. Up to 925 conditions per place. [2024-06-03 22:28:33,274 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 253 selfloop transitions, 20 changer transitions 0/277 dead transitions. [2024-06-03 22:28:33,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 277 transitions, 2831 flow [2024-06-03 22:28:33,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:28:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:28:33,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 146 transitions. [2024-06-03 22:28:33,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3686868686868687 [2024-06-03 22:28:33,275 INFO L175 Difference]: Start difference. First operand has 283 places, 266 transitions, 2261 flow. Second operand 12 states and 146 transitions. [2024-06-03 22:28:33,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 277 transitions, 2831 flow [2024-06-03 22:28:33,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 277 transitions, 2586 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-06-03 22:28:33,467 INFO L231 Difference]: Finished difference. Result has 286 places, 266 transitions, 2061 flow [2024-06-03 22:28:33,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2016, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2061, PETRI_PLACES=286, PETRI_TRANSITIONS=266} [2024-06-03 22:28:33,467 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 254 predicate places. [2024-06-03 22:28:33,467 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 266 transitions, 2061 flow [2024-06-03 22:28:33,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:33,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:33,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:33,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-03 22:28:33,468 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-03 22:28:33,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:33,468 INFO L85 PathProgramCache]: Analyzing trace with hash -944331782, now seen corresponding path program 17 times [2024-06-03 22:28:33,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:33,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633331802] [2024-06-03 22:28:33,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:33,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:40,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:40,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:40,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633331802] [2024-06-03 22:28:40,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633331802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:40,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:40,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:40,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617915519] [2024-06-03 22:28:40,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:40,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:40,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:40,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:40,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:41,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:28:41,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 266 transitions, 2061 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:41,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:41,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:28:41,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:41,496 INFO L124 PetriNetUnfolderBase]: 532/1043 cut-off events. [2024-06-03 22:28:41,496 INFO L125 PetriNetUnfolderBase]: For 53812/53812 co-relation queries the response was YES. [2024-06-03 22:28:41,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5269 conditions, 1043 events. 532/1043 cut-off events. For 53812/53812 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 6049 event pairs, 59 based on Foata normal form. 1/1038 useless extension candidates. Maximal degree in co-relation 5147. Up to 760 conditions per place. [2024-06-03 22:28:41,506 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 188 selfloop transitions, 88 changer transitions 0/280 dead transitions. [2024-06-03 22:28:41,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 280 transitions, 2731 flow [2024-06-03 22:28:41,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:28:41,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:28:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2024-06-03 22:28:41,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40771349862258954 [2024-06-03 22:28:41,507 INFO L175 Difference]: Start difference. First operand has 286 places, 266 transitions, 2061 flow. Second operand 11 states and 148 transitions. [2024-06-03 22:28:41,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 280 transitions, 2731 flow [2024-06-03 22:28:41,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 280 transitions, 2670 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-03 22:28:41,711 INFO L231 Difference]: Finished difference. Result has 285 places, 270 transitions, 2281 flow [2024-06-03 22:28:41,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2000, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2281, PETRI_PLACES=285, PETRI_TRANSITIONS=270} [2024-06-03 22:28:41,711 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 253 predicate places. [2024-06-03 22:28:41,711 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 270 transitions, 2281 flow [2024-06-03 22:28:41,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:41,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:41,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:41,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-03 22:28:41,712 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-03 22:28:41,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:41,712 INFO L85 PathProgramCache]: Analyzing trace with hash -944035112, now seen corresponding path program 18 times [2024-06-03 22:28:41,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:41,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341199578] [2024-06-03 22:28:41,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:41,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:50,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:50,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341199578] [2024-06-03 22:28:50,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341199578] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:50,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:50,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:50,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200282494] [2024-06-03 22:28:50,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:50,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:50,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:50,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:50,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:50,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:28:50,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 270 transitions, 2281 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:50,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:50,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:28:50,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:50,808 INFO L124 PetriNetUnfolderBase]: 535/1048 cut-off events. [2024-06-03 22:28:50,808 INFO L125 PetriNetUnfolderBase]: For 55850/55850 co-relation queries the response was YES. [2024-06-03 22:28:50,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5514 conditions, 1048 events. 535/1048 cut-off events. For 55850/55850 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6069 event pairs, 59 based on Foata normal form. 1/1043 useless extension candidates. Maximal degree in co-relation 5391. Up to 755 conditions per place. [2024-06-03 22:28:50,818 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 188 selfloop transitions, 94 changer transitions 0/286 dead transitions. [2024-06-03 22:28:50,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 286 transitions, 3229 flow [2024-06-03 22:28:50,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:28:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:28:50,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2024-06-03 22:28:50,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065656565656566 [2024-06-03 22:28:50,820 INFO L175 Difference]: Start difference. First operand has 285 places, 270 transitions, 2281 flow. Second operand 12 states and 161 transitions. [2024-06-03 22:28:50,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 286 transitions, 3229 flow [2024-06-03 22:28:50,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 286 transitions, 2982 flow, removed 38 selfloop flow, removed 8 redundant places. [2024-06-03 22:28:50,999 INFO L231 Difference]: Finished difference. Result has 289 places, 274 transitions, 2399 flow [2024-06-03 22:28:51,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2034, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2399, PETRI_PLACES=289, PETRI_TRANSITIONS=274} [2024-06-03 22:28:51,000 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 257 predicate places. [2024-06-03 22:28:51,000 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 274 transitions, 2399 flow [2024-06-03 22:28:51,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:51,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:51,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:51,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-03 22:28:51,000 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-03 22:28:51,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:51,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1174251032, now seen corresponding path program 19 times [2024-06-03 22:28:51,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:51,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754924221] [2024-06-03 22:28:51,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:51,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:58,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:58,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754924221] [2024-06-03 22:28:58,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754924221] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:58,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:58,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:28:58,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738004260] [2024-06-03 22:28:58,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:58,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:28:58,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:58,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:28:58,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:28:58,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:28:58,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 274 transitions, 2399 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:58,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:58,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:28:58,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:59,078 INFO L124 PetriNetUnfolderBase]: 541/1058 cut-off events. [2024-06-03 22:28:59,078 INFO L125 PetriNetUnfolderBase]: For 57274/57274 co-relation queries the response was YES. [2024-06-03 22:28:59,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5608 conditions, 1058 events. 541/1058 cut-off events. For 57274/57274 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 6152 event pairs, 59 based on Foata normal form. 1/1053 useless extension candidates. Maximal degree in co-relation 5484. Up to 774 conditions per place. [2024-06-03 22:28:59,089 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 195 selfloop transitions, 89 changer transitions 0/288 dead transitions. [2024-06-03 22:28:59,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 288 transitions, 3097 flow [2024-06-03 22:28:59,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:28:59,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:28:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-03 22:28:59,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41046831955922863 [2024-06-03 22:28:59,090 INFO L175 Difference]: Start difference. First operand has 289 places, 274 transitions, 2399 flow. Second operand 11 states and 149 transitions. [2024-06-03 22:28:59,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 288 transitions, 3097 flow [2024-06-03 22:28:59,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 288 transitions, 2869 flow, removed 60 selfloop flow, removed 8 redundant places. [2024-06-03 22:28:59,293 INFO L231 Difference]: Finished difference. Result has 292 places, 278 transitions, 2466 flow [2024-06-03 22:28:59,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2193, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2466, PETRI_PLACES=292, PETRI_TRANSITIONS=278} [2024-06-03 22:28:59,294 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 260 predicate places. [2024-06-03 22:28:59,294 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 278 transitions, 2466 flow [2024-06-03 22:28:59,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:59,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:59,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:59,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-03 22:28:59,294 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-03 22:28:59,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:59,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1180507142, now seen corresponding path program 20 times [2024-06-03 22:28:59,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:59,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300289778] [2024-06-03 22:28:59,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:59,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:06,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:06,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:06,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300289778] [2024-06-03 22:29:06,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300289778] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:06,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:06,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:29:06,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888279370] [2024-06-03 22:29:06,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:06,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:29:06,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:06,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:29:06,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:29:06,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:29:06,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 278 transitions, 2466 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:06,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:06,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:29:06,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:07,201 INFO L124 PetriNetUnfolderBase]: 539/1055 cut-off events. [2024-06-03 22:29:07,202 INFO L125 PetriNetUnfolderBase]: For 52565/52565 co-relation queries the response was YES. [2024-06-03 22:29:07,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5502 conditions, 1055 events. 539/1055 cut-off events. For 52565/52565 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 6137 event pairs, 59 based on Foata normal form. 1/1050 useless extension candidates. Maximal degree in co-relation 5376. Up to 771 conditions per place. [2024-06-03 22:29:07,211 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 192 selfloop transitions, 92 changer transitions 0/288 dead transitions. [2024-06-03 22:29:07,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 288 transitions, 3056 flow [2024-06-03 22:29:07,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-03 22:29:07,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-03 22:29:07,212 INFO L175 Difference]: Start difference. First operand has 292 places, 278 transitions, 2466 flow. Second operand 11 states and 147 transitions. [2024-06-03 22:29:07,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 288 transitions, 3056 flow [2024-06-03 22:29:07,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 288 transitions, 2778 flow, removed 57 selfloop flow, removed 7 redundant places. [2024-06-03 22:29:07,425 INFO L231 Difference]: Finished difference. Result has 296 places, 278 transitions, 2377 flow [2024-06-03 22:29:07,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2188, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2377, PETRI_PLACES=296, PETRI_TRANSITIONS=278} [2024-06-03 22:29:07,426 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 264 predicate places. [2024-06-03 22:29:07,426 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 278 transitions, 2377 flow [2024-06-03 22:29:07,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:07,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:07,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:07,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-03 22:29:07,426 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-03 22:29:07,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:07,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1522303173, now seen corresponding path program 1 times [2024-06-03 22:29:07,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:07,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517407811] [2024-06-03 22:29:07,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:07,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:14,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:14,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517407811] [2024-06-03 22:29:14,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517407811] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:14,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:14,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:29:14,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10306030] [2024-06-03 22:29:14,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:14,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:29:14,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:14,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:29:14,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:29:14,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:29:14,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 278 transitions, 2377 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:14,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:14,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:29:14,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:15,217 INFO L124 PetriNetUnfolderBase]: 550/1078 cut-off events. [2024-06-03 22:29:15,218 INFO L125 PetriNetUnfolderBase]: For 67880/67880 co-relation queries the response was YES. [2024-06-03 22:29:15,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5717 conditions, 1078 events. 550/1078 cut-off events. For 67880/67880 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 6284 event pairs, 44 based on Foata normal form. 2/1078 useless extension candidates. Maximal degree in co-relation 5590. Up to 846 conditions per place. [2024-06-03 22:29:15,228 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 258 selfloop transitions, 37 changer transitions 0/299 dead transitions. [2024-06-03 22:29:15,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 299 transitions, 3235 flow [2024-06-03 22:29:15,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:15,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-03 22:29:15,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41046831955922863 [2024-06-03 22:29:15,228 INFO L175 Difference]: Start difference. First operand has 296 places, 278 transitions, 2377 flow. Second operand 11 states and 149 transitions. [2024-06-03 22:29:15,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 299 transitions, 3235 flow [2024-06-03 22:29:15,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 299 transitions, 2982 flow, removed 5 selfloop flow, removed 12 redundant places. [2024-06-03 22:29:15,407 INFO L231 Difference]: Finished difference. Result has 295 places, 280 transitions, 2232 flow [2024-06-03 22:29:15,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2232, PETRI_PLACES=295, PETRI_TRANSITIONS=280} [2024-06-03 22:29:15,408 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 263 predicate places. [2024-06-03 22:29:15,408 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 280 transitions, 2232 flow [2024-06-03 22:29:15,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:15,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:15,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:15,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-03 22:29:15,409 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-03 22:29:15,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:15,409 INFO L85 PathProgramCache]: Analyzing trace with hash -81873307, now seen corresponding path program 2 times [2024-06-03 22:29:15,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:15,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453078168] [2024-06-03 22:29:15,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:15,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:22,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:22,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453078168] [2024-06-03 22:29:22,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453078168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:22,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:22,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:29:22,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949346984] [2024-06-03 22:29:22,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:22,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:29:22,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:22,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:29:22,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:29:22,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:29:22,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 280 transitions, 2232 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:22,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:22,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:29:22,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:22,811 INFO L124 PetriNetUnfolderBase]: 554/1086 cut-off events. [2024-06-03 22:29:22,811 INFO L125 PetriNetUnfolderBase]: For 69116/69116 co-relation queries the response was YES. [2024-06-03 22:29:22,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5646 conditions, 1086 events. 554/1086 cut-off events. For 69116/69116 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6354 event pairs, 57 based on Foata normal form. 2/1086 useless extension candidates. Maximal degree in co-relation 5518. Up to 897 conditions per place. [2024-06-03 22:29:22,821 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 235 selfloop transitions, 55 changer transitions 0/294 dead transitions. [2024-06-03 22:29:22,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 294 transitions, 2858 flow [2024-06-03 22:29:22,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-03 22:29:22,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39669421487603307 [2024-06-03 22:29:22,824 INFO L175 Difference]: Start difference. First operand has 295 places, 280 transitions, 2232 flow. Second operand 11 states and 144 transitions. [2024-06-03 22:29:22,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 294 transitions, 2858 flow [2024-06-03 22:29:22,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 294 transitions, 2797 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 22:29:23,001 INFO L231 Difference]: Finished difference. Result has 299 places, 281 transitions, 2304 flow [2024-06-03 22:29:23,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2171, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2304, PETRI_PLACES=299, PETRI_TRANSITIONS=281} [2024-06-03 22:29:23,002 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 267 predicate places. [2024-06-03 22:29:23,002 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 281 transitions, 2304 flow [2024-06-03 22:29:23,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:23,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:23,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:23,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-03 22:29:23,003 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-03 22:29:23,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:23,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1412277869, now seen corresponding path program 3 times [2024-06-03 22:29:23,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:23,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110701373] [2024-06-03 22:29:23,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:23,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:29,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:29,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110701373] [2024-06-03 22:29:29,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110701373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:29,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:29,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:29:29,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655944444] [2024-06-03 22:29:29,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:29,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:29:29,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:29,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:29:29,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:29:29,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:29:29,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 281 transitions, 2304 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:29,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:29,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:29:29,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:30,447 INFO L124 PetriNetUnfolderBase]: 565/1107 cut-off events. [2024-06-03 22:29:30,448 INFO L125 PetriNetUnfolderBase]: For 79949/79949 co-relation queries the response was YES. [2024-06-03 22:29:30,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6044 conditions, 1107 events. 565/1107 cut-off events. For 79949/79949 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6492 event pairs, 58 based on Foata normal form. 2/1107 useless extension candidates. Maximal degree in co-relation 5914. Up to 891 conditions per place. [2024-06-03 22:29:30,456 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 238 selfloop transitions, 56 changer transitions 0/298 dead transitions. [2024-06-03 22:29:30,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 298 transitions, 3162 flow [2024-06-03 22:29:30,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:30,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:30,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-03 22:29:30,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-03 22:29:30,457 INFO L175 Difference]: Start difference. First operand has 299 places, 281 transitions, 2304 flow. Second operand 11 states and 146 transitions. [2024-06-03 22:29:30,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 298 transitions, 3162 flow [2024-06-03 22:29:30,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 298 transitions, 3041 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-03 22:29:30,719 INFO L231 Difference]: Finished difference. Result has 301 places, 283 transitions, 2337 flow [2024-06-03 22:29:30,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2183, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2337, PETRI_PLACES=301, PETRI_TRANSITIONS=283} [2024-06-03 22:29:30,719 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 269 predicate places. [2024-06-03 22:29:30,719 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 283 transitions, 2337 flow [2024-06-03 22:29:30,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:30,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:30,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:30,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-03 22:29:30,720 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-03 22:29:30,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1544311149, now seen corresponding path program 4 times [2024-06-03 22:29:30,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:30,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138424036] [2024-06-03 22:29:30,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:30,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:38,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-03 22:29:38,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:38,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138424036] [2024-06-03 22:29:38,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138424036] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:38,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:38,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:29:38,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437043143] [2024-06-03 22:29:38,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:38,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:29:38,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:38,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:29:38,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:29:38,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:29:38,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 283 transitions, 2337 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:38,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:38,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:29:38,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:38,796 INFO L124 PetriNetUnfolderBase]: 562/1102 cut-off events. [2024-06-03 22:29:38,797 INFO L125 PetriNetUnfolderBase]: For 71200/71200 co-relation queries the response was YES. [2024-06-03 22:29:38,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5825 conditions, 1102 events. 562/1102 cut-off events. For 71200/71200 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6440 event pairs, 61 based on Foata normal form. 2/1102 useless extension candidates. Maximal degree in co-relation 5694. Up to 913 conditions per place. [2024-06-03 22:29:38,807 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 232 selfloop transitions, 60 changer transitions 0/296 dead transitions. [2024-06-03 22:29:38,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 296 transitions, 2951 flow [2024-06-03 22:29:38,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:38,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2024-06-03 22:29:38,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-03 22:29:38,808 INFO L175 Difference]: Start difference. First operand has 301 places, 283 transitions, 2337 flow. Second operand 11 states and 143 transitions. [2024-06-03 22:29:38,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 296 transitions, 2951 flow [2024-06-03 22:29:39,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 296 transitions, 2852 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-03 22:29:39,035 INFO L231 Difference]: Finished difference. Result has 305 places, 283 transitions, 2363 flow [2024-06-03 22:29:39,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2238, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2363, PETRI_PLACES=305, PETRI_TRANSITIONS=283} [2024-06-03 22:29:39,035 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 273 predicate places. [2024-06-03 22:29:39,035 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 283 transitions, 2363 flow [2024-06-03 22:29:39,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:39,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:39,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:39,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-03 22:29:39,036 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-03 22:29:39,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:39,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1607539473, now seen corresponding path program 5 times [2024-06-03 22:29:39,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:39,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922407456] [2024-06-03 22:29:39,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:39,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:46,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:46,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922407456] [2024-06-03 22:29:46,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922407456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:46,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:46,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:29:46,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107410608] [2024-06-03 22:29:46,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:46,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:29:46,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:46,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:29:46,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:29:46,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:29:46,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 283 transitions, 2363 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:46,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:46,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:29:46,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:47,045 INFO L124 PetriNetUnfolderBase]: 566/1109 cut-off events. [2024-06-03 22:29:47,046 INFO L125 PetriNetUnfolderBase]: For 72924/72924 co-relation queries the response was YES. [2024-06-03 22:29:47,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5920 conditions, 1109 events. 566/1109 cut-off events. For 72924/72924 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6547 event pairs, 56 based on Foata normal form. 2/1109 useless extension candidates. Maximal degree in co-relation 5787. Up to 869 conditions per place. [2024-06-03 22:29:47,057 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 223 selfloop transitions, 70 changer transitions 0/297 dead transitions. [2024-06-03 22:29:47,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 297 transitions, 2999 flow [2024-06-03 22:29:47,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:47,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-03 22:29:47,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-03 22:29:47,059 INFO L175 Difference]: Start difference. First operand has 305 places, 283 transitions, 2363 flow. Second operand 11 states and 147 transitions. [2024-06-03 22:29:47,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 297 transitions, 2999 flow [2024-06-03 22:29:47,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 297 transitions, 2871 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-03 22:29:47,248 INFO L231 Difference]: Finished difference. Result has 306 places, 284 transitions, 2402 flow [2024-06-03 22:29:47,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2235, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2402, PETRI_PLACES=306, PETRI_TRANSITIONS=284} [2024-06-03 22:29:47,248 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 274 predicate places. [2024-06-03 22:29:47,249 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 284 transitions, 2402 flow [2024-06-03 22:29:47,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:47,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:47,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:47,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-03 22:29:47,249 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-03 22:29:47,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:47,250 INFO L85 PathProgramCache]: Analyzing trace with hash -465873805, now seen corresponding path program 6 times [2024-06-03 22:29:47,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:47,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067415130] [2024-06-03 22:29:47,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:47,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:54,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:54,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:54,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067415130] [2024-06-03 22:29:54,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067415130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:54,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:54,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:29:54,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481773802] [2024-06-03 22:29:54,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:54,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:29:54,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:54,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:29:54,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:29:54,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:29:54,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 284 transitions, 2402 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:54,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:54,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:29:54,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:54,635 INFO L124 PetriNetUnfolderBase]: 570/1118 cut-off events. [2024-06-03 22:29:54,635 INFO L125 PetriNetUnfolderBase]: For 73820/73820 co-relation queries the response was YES. [2024-06-03 22:29:54,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6015 conditions, 1118 events. 570/1118 cut-off events. For 73820/73820 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6584 event pairs, 63 based on Foata normal form. 2/1118 useless extension candidates. Maximal degree in co-relation 5881. Up to 913 conditions per place. [2024-06-03 22:29:54,646 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 244 selfloop transitions, 51 changer transitions 0/299 dead transitions. [2024-06-03 22:29:54,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 299 transitions, 3046 flow [2024-06-03 22:29:54,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-03 22:29:54,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-03 22:29:54,647 INFO L175 Difference]: Start difference. First operand has 306 places, 284 transitions, 2402 flow. Second operand 11 states and 147 transitions. [2024-06-03 22:29:54,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 299 transitions, 3046 flow [2024-06-03 22:29:54,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 299 transitions, 2891 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-03 22:29:54,866 INFO L231 Difference]: Finished difference. Result has 308 places, 285 transitions, 2377 flow [2024-06-03 22:29:54,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2247, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2377, PETRI_PLACES=308, PETRI_TRANSITIONS=285} [2024-06-03 22:29:54,866 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 276 predicate places. [2024-06-03 22:29:54,866 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 285 transitions, 2377 flow [2024-06-03 22:29:54,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:54,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:54,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:54,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-03 22:29:54,867 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-03 22:29:54,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:54,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1831143163, now seen corresponding path program 7 times [2024-06-03 22:29:54,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:54,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590598139] [2024-06-03 22:29:54,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:54,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:02,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:02,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:02,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590598139] [2024-06-03 22:30:02,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590598139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:02,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:02,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:30:02,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676722370] [2024-06-03 22:30:02,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:02,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:30:02,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:02,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:30:02,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:30:03,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:30:03,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 285 transitions, 2377 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:03,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:03,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:30:03,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:03,450 INFO L124 PetriNetUnfolderBase]: 574/1126 cut-off events. [2024-06-03 22:30:03,450 INFO L125 PetriNetUnfolderBase]: For 75839/75839 co-relation queries the response was YES. [2024-06-03 22:30:03,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6031 conditions, 1126 events. 574/1126 cut-off events. For 75839/75839 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 6634 event pairs, 57 based on Foata normal form. 2/1126 useless extension candidates. Maximal degree in co-relation 5896. Up to 897 conditions per place. [2024-06-03 22:30:03,461 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 246 selfloop transitions, 51 changer transitions 0/301 dead transitions. [2024-06-03 22:30:03,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 301 transitions, 3029 flow [2024-06-03 22:30:03,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:03,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:03,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-03 22:30:03,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41046831955922863 [2024-06-03 22:30:03,462 INFO L175 Difference]: Start difference. First operand has 308 places, 285 transitions, 2377 flow. Second operand 11 states and 149 transitions. [2024-06-03 22:30:03,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 301 transitions, 3029 flow [2024-06-03 22:30:03,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 301 transitions, 2909 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-03 22:30:03,770 INFO L231 Difference]: Finished difference. Result has 310 places, 286 transitions, 2389 flow [2024-06-03 22:30:03,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2257, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2389, PETRI_PLACES=310, PETRI_TRANSITIONS=286} [2024-06-03 22:30:03,770 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 278 predicate places. [2024-06-03 22:30:03,770 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 286 transitions, 2389 flow [2024-06-03 22:30:03,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:03,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:03,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:03,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-03 22:30:03,771 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-03 22:30:03,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:03,771 INFO L85 PathProgramCache]: Analyzing trace with hash -753017211, now seen corresponding path program 8 times [2024-06-03 22:30:03,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:03,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060502184] [2024-06-03 22:30:03,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:03,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:11,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:11,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060502184] [2024-06-03 22:30:11,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060502184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:11,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:11,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:30:11,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829507304] [2024-06-03 22:30:11,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:11,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:30:11,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:11,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:30:11,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:30:11,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:30:11,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 286 transitions, 2389 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:11,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:11,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:30:11,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:12,394 INFO L124 PetriNetUnfolderBase]: 578/1133 cut-off events. [2024-06-03 22:30:12,394 INFO L125 PetriNetUnfolderBase]: For 77940/77940 co-relation queries the response was YES. [2024-06-03 22:30:12,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6085 conditions, 1133 events. 578/1133 cut-off events. For 77940/77940 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 6701 event pairs, 62 based on Foata normal form. 2/1133 useless extension candidates. Maximal degree in co-relation 5949. Up to 893 conditions per place. [2024-06-03 22:30:12,405 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 222 selfloop transitions, 74 changer transitions 0/300 dead transitions. [2024-06-03 22:30:12,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 300 transitions, 3037 flow [2024-06-03 22:30:12,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:12,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:12,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-03 22:30:12,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-03 22:30:12,406 INFO L175 Difference]: Start difference. First operand has 310 places, 286 transitions, 2389 flow. Second operand 11 states and 146 transitions. [2024-06-03 22:30:12,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 300 transitions, 3037 flow [2024-06-03 22:30:12,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 300 transitions, 2915 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-03 22:30:12,647 INFO L231 Difference]: Finished difference. Result has 312 places, 287 transitions, 2448 flow [2024-06-03 22:30:12,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2267, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2448, PETRI_PLACES=312, PETRI_TRANSITIONS=287} [2024-06-03 22:30:12,647 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 280 predicate places. [2024-06-03 22:30:12,647 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 287 transitions, 2448 flow [2024-06-03 22:30:12,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:12,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:12,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:12,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-03 22:30:12,648 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-03 22:30:12,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:12,648 INFO L85 PathProgramCache]: Analyzing trace with hash -753022791, now seen corresponding path program 9 times [2024-06-03 22:30:12,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:12,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917988663] [2024-06-03 22:30:12,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:12,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:19,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:19,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917988663] [2024-06-03 22:30:19,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917988663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:19,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:19,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:30:19,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166312493] [2024-06-03 22:30:19,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:19,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:30:19,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:19,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:30:19,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:30:19,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:30:19,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 287 transitions, 2448 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:19,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:19,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:30:19,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:20,477 INFO L124 PetriNetUnfolderBase]: 582/1142 cut-off events. [2024-06-03 22:30:20,477 INFO L125 PetriNetUnfolderBase]: For 79624/79624 co-relation queries the response was YES. [2024-06-03 22:30:20,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6174 conditions, 1142 events. 582/1142 cut-off events. For 79624/79624 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 6752 event pairs, 63 based on Foata normal form. 2/1142 useless extension candidates. Maximal degree in co-relation 6037. Up to 937 conditions per place. [2024-06-03 22:30:20,489 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 246 selfloop transitions, 52 changer transitions 0/302 dead transitions. [2024-06-03 22:30:20,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 302 transitions, 3104 flow [2024-06-03 22:30:20,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:20,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:20,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-03 22:30:20,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-03 22:30:20,490 INFO L175 Difference]: Start difference. First operand has 312 places, 287 transitions, 2448 flow. Second operand 11 states and 147 transitions. [2024-06-03 22:30:20,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 302 transitions, 3104 flow [2024-06-03 22:30:20,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 302 transitions, 2935 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-03 22:30:20,750 INFO L231 Difference]: Finished difference. Result has 314 places, 288 transitions, 2417 flow [2024-06-03 22:30:20,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2279, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2417, PETRI_PLACES=314, PETRI_TRANSITIONS=288} [2024-06-03 22:30:20,750 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 282 predicate places. [2024-06-03 22:30:20,751 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 288 transitions, 2417 flow [2024-06-03 22:30:20,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:20,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:20,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:20,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-03 22:30:20,751 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-03 22:30:20,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:20,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1973246233, now seen corresponding path program 10 times [2024-06-03 22:30:20,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:20,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944521763] [2024-06-03 22:30:20,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:20,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:28,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:28,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:28,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944521763] [2024-06-03 22:30:28,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944521763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:28,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:28,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:30:28,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849520651] [2024-06-03 22:30:28,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:28,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:30:28,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:28,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:30:28,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:30:28,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:30:28,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 288 transitions, 2417 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:28,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:28,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:30:28,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:28,717 INFO L124 PetriNetUnfolderBase]: 593/1162 cut-off events. [2024-06-03 22:30:28,717 INFO L125 PetriNetUnfolderBase]: For 92934/92934 co-relation queries the response was YES. [2024-06-03 22:30:28,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6507 conditions, 1162 events. 593/1162 cut-off events. For 92934/92934 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 6886 event pairs, 61 based on Foata normal form. 2/1162 useless extension candidates. Maximal degree in co-relation 6369. Up to 767 conditions per place. [2024-06-03 22:30:28,727 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 227 selfloop transitions, 76 changer transitions 0/307 dead transitions. [2024-06-03 22:30:28,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 307 transitions, 3335 flow [2024-06-03 22:30:28,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2024-06-03 22:30:28,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41597796143250687 [2024-06-03 22:30:28,728 INFO L175 Difference]: Start difference. First operand has 314 places, 288 transitions, 2417 flow. Second operand 11 states and 151 transitions. [2024-06-03 22:30:28,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 307 transitions, 3335 flow [2024-06-03 22:30:29,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 307 transitions, 3207 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-03 22:30:29,047 INFO L231 Difference]: Finished difference. Result has 316 places, 290 transitions, 2507 flow [2024-06-03 22:30:29,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2289, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2507, PETRI_PLACES=316, PETRI_TRANSITIONS=290} [2024-06-03 22:30:29,048 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 284 predicate places. [2024-06-03 22:30:29,048 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 290 transitions, 2507 flow [2024-06-03 22:30:29,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:29,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:29,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:29,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-03 22:30:29,048 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-03 22:30:29,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:29,049 INFO L85 PathProgramCache]: Analyzing trace with hash -753166941, now seen corresponding path program 11 times [2024-06-03 22:30:29,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:29,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830420681] [2024-06-03 22:30:29,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:29,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:36,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:36,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830420681] [2024-06-03 22:30:36,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830420681] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:36,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:36,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:30:36,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900115984] [2024-06-03 22:30:36,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:36,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:30:36,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:36,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:30:36,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:30:36,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:30:36,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 290 transitions, 2507 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:36,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:36,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:30:36,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:36,863 INFO L124 PetriNetUnfolderBase]: 590/1158 cut-off events. [2024-06-03 22:30:36,863 INFO L125 PetriNetUnfolderBase]: For 82975/82975 co-relation queries the response was YES. [2024-06-03 22:30:36,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6302 conditions, 1158 events. 590/1158 cut-off events. For 82975/82975 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 6883 event pairs, 65 based on Foata normal form. 2/1158 useless extension candidates. Maximal degree in co-relation 6163. Up to 897 conditions per place. [2024-06-03 22:30:36,874 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 246 selfloop transitions, 55 changer transitions 0/305 dead transitions. [2024-06-03 22:30:36,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 305 transitions, 3143 flow [2024-06-03 22:30:36,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:36,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-03 22:30:36,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-03 22:30:36,876 INFO L175 Difference]: Start difference. First operand has 316 places, 290 transitions, 2507 flow. Second operand 11 states and 147 transitions. [2024-06-03 22:30:36,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 305 transitions, 3143 flow [2024-06-03 22:30:37,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 305 transitions, 2992 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-03 22:30:37,118 INFO L231 Difference]: Finished difference. Result has 319 places, 290 transitions, 2470 flow [2024-06-03 22:30:37,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2356, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2470, PETRI_PLACES=319, PETRI_TRANSITIONS=290} [2024-06-03 22:30:37,119 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 287 predicate places. [2024-06-03 22:30:37,119 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 290 transitions, 2470 flow [2024-06-03 22:30:37,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:37,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:37,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:37,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-03 22:30:37,119 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-03 22:30:37,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:37,119 INFO L85 PathProgramCache]: Analyzing trace with hash -272953723, now seen corresponding path program 12 times [2024-06-03 22:30:37,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:37,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158350318] [2024-06-03 22:30:37,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:37,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:44,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:44,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:44,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158350318] [2024-06-03 22:30:44,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158350318] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:44,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:44,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:30:44,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377431785] [2024-06-03 22:30:44,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:44,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:30:44,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:44,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:30:44,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:30:44,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-03 22:30:44,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 290 transitions, 2470 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:44,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:44,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-03 22:30:44,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:45,027 INFO L124 PetriNetUnfolderBase]: 601/1179 cut-off events. [2024-06-03 22:30:45,027 INFO L125 PetriNetUnfolderBase]: For 95497/95497 co-relation queries the response was YES. [2024-06-03 22:30:45,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6575 conditions, 1179 events. 601/1179 cut-off events. For 95497/95497 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 7040 event pairs, 65 based on Foata normal form. 2/1179 useless extension candidates. Maximal degree in co-relation 6435. Up to 999 conditions per place. [2024-06-03 22:30:45,039 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 264 selfloop transitions, 41 changer transitions 0/309 dead transitions. [2024-06-03 22:30:45,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 309 transitions, 3362 flow [2024-06-03 22:30:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-03 22:30:45,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2024-06-03 22:30:45,041 INFO L175 Difference]: Start difference. First operand has 319 places, 290 transitions, 2470 flow. Second operand 11 states and 145 transitions. [2024-06-03 22:30:45,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 309 transitions, 3362 flow [2024-06-03 22:30:45,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 309 transitions, 3178 flow, removed 7 selfloop flow, removed 11 redundant places. [2024-06-03 22:30:45,289 INFO L231 Difference]: Finished difference. Result has 319 places, 292 transitions, 2398 flow [2024-06-03 22:30:45,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2286, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2398, PETRI_PLACES=319, PETRI_TRANSITIONS=292} [2024-06-03 22:30:45,289 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 287 predicate places. [2024-06-03 22:30:45,289 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 292 transitions, 2398 flow [2024-06-03 22:30:45,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:45,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:45,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:45,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-03 22:30:45,290 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-03 22:30:45,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:45,290 INFO L85 PathProgramCache]: Analyzing trace with hash -128855803, now seen corresponding path program 13 times [2024-06-03 22:30:45,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:45,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439566214] [2024-06-03 22:30:45,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:45,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15