./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.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/mix000.oepc.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/mix000.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix000.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 16:30:09,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 16:30:09,913 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 16:30:09,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 16:30:09,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 16:30:09,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 16:30:09,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 16:30:09,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 16:30:09,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 16:30:09,945 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 16:30:09,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 16:30:09,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 16:30:09,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 16:30:09,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 16:30:09,948 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 16:30:09,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 16:30:09,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 16:30:09,948 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 16:30:09,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 16:30:09,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 16:30:09,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 16:30:09,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 16:30:09,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 16:30:09,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 16:30:09,951 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 16:30:09,951 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 16:30:09,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 16:30:09,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 16:30:09,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 16:30:09,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 16:30:09,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 16:30:09,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 16:30:09,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:30:09,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 16:30:09,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 16:30:09,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 16:30:09,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 16:30:09,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 16:30:09,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 16:30:09,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 16:30:09,955 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 16:30:09,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 16:30:09,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 16:30:09,955 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 16:30:10,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 16:30:10,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 16:30:10,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 16:30:10,182 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 16:30:10,183 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 16:30:10,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i [2024-06-04 16:30:11,262 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 16:30:11,488 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 16:30:11,492 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.oepc.i [2024-06-04 16:30:11,502 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ea34bce1/89144ee5249d4874bad67b2b7c5bc95d/FLAG112cf0e66 [2024-06-04 16:30:11,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ea34bce1/89144ee5249d4874bad67b2b7c5bc95d [2024-06-04 16:30:11,517 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 16:30:11,517 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 16:30:11,518 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/mix000.oepc.yml/witness.yml [2024-06-04 16:30:11,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 16:30:11,646 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 16:30:11,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 16:30:11,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 16:30:11,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 16:30:11,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:30:11" (1/2) ... [2024-06-04 16:30:11,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d6730c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:30:11, skipping insertion in model container [2024-06-04 16:30:11,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:30:11" (1/2) ... [2024-06-04 16:30:11,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5ed3af33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:30:11, skipping insertion in model container [2024-06-04 16:30:11,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:30:11" (2/2) ... [2024-06-04 16:30:11,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d6730c5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:11, skipping insertion in model container [2024-06-04 16:30:11,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:30:11" (2/2) ... [2024-06-04 16:30:11,656 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 16:30:11,713 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 16:30:11,714 INFO L97 edCorrectnessWitness]: Location invariant before [L834-L834] (((((((((((((((((! multithreaded || y$r_buff1_thd2 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 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_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 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_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 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) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 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)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0) [2024-06-04 16:30:11,714 INFO L97 edCorrectnessWitness]: Location invariant before [L835-L835] (((((((((((((((((! multithreaded || y$r_buff1_thd2 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 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_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 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_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 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) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 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)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0) [2024-06-04 16:30:11,715 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 16:30:11,715 INFO L106 edCorrectnessWitness]: ghost_update [L832-L832] multithreaded = 1; [2024-06-04 16:30:11,756 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 16:30:12,103 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:30:12,113 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 16:30:12,363 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:30:12,398 INFO L206 MainTranslator]: Completed translation [2024-06-04 16:30:12,399 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:12 WrapperNode [2024-06-04 16:30:12,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 16:30:12,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 16:30:12,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 16:30:12,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 16:30:12,406 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 04.06 04:30:12" (1/1) ... [2024-06-04 16:30:12,437 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 04.06 04:30:12" (1/1) ... [2024-06-04 16:30:12,514 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-06-04 16:30:12,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 16:30:12,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 16:30:12,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 16:30:12,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 16:30:12,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:12" (1/1) ... [2024-06-04 16:30:12,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:12" (1/1) ... [2024-06-04 16:30:12,532 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:12" (1/1) ... [2024-06-04 16:30:12,560 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-04 16:30:12,561 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:12" (1/1) ... [2024-06-04 16:30:12,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:12" (1/1) ... [2024-06-04 16:30:12,574 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:12" (1/1) ... [2024-06-04 16:30:12,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:12" (1/1) ... [2024-06-04 16:30:12,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:12" (1/1) ... [2024-06-04 16:30:12,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:12" (1/1) ... [2024-06-04 16:30:12,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 16:30:12,597 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 16:30:12,597 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 16:30:12,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 16:30:12,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:12" (1/1) ... [2024-06-04 16:30:12,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:30:12,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:30:12,638 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 16:30:12,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 16:30:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 16:30:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 16:30:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 16:30:12,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 16:30:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 16:30:12,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 16:30:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 16:30:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 16:30:12,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 16:30:12,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 16:30:12,732 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 16:30:12,878 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 16:30:12,880 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 16:30:13,525 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 16:30:13,525 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 16:30:13,671 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 16:30:13,671 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 16:30:13,672 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:30:13 BoogieIcfgContainer [2024-06-04 16:30:13,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 16:30:13,673 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 16:30:13,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 16:30:13,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 16:30:13,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 04:30:11" (1/4) ... [2024-06-04 16:30:13,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8433a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:30:13, skipping insertion in model container [2024-06-04 16:30:13,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:30:11" (2/4) ... [2024-06-04 16:30:13,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8433a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:30:13, skipping insertion in model container [2024-06-04 16:30:13,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:12" (3/4) ... [2024-06-04 16:30:13,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8433a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:30:13, skipping insertion in model container [2024-06-04 16:30:13,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:30:13" (4/4) ... [2024-06-04 16:30:13,678 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.oepc.i [2024-06-04 16:30:13,691 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 16:30:13,692 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 16:30:13,692 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 16:30:13,756 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 16:30:13,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 72 flow [2024-06-04 16:30:13,806 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-04 16:30:13,806 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:30:13,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 16:30:13,808 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 72 flow [2024-06-04 16:30:13,810 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-06-04 16:30:13,816 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:30:13,821 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;@4527c04b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:30:13,821 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 16:30:13,827 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:30:13,827 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-04 16:30:13,827 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:30:13,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:13,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 16:30:13,828 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-04 16:30:13,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:13,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1460724257, now seen corresponding path program 1 times [2024-06-04 16:30:13,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:13,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444523264] [2024-06-04 16:30:13,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:13,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:17,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-04 16:30:17,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:17,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444523264] [2024-06-04 16:30:17,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444523264] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:17,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:17,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:30:17,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632151212] [2024-06-04 16:30:17,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:17,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:30:17,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:17,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:30:17,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:30:17,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-04 16:30:17,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:17,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:17,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-04 16:30:17,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:17,465 INFO L124 PetriNetUnfolderBase]: 162/310 cut-off events. [2024-06-04 16:30:17,465 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-04 16:30:17,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 310 events. 162/310 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1182 event pairs, 97 based on Foata normal form. 1/304 useless extension candidates. Maximal degree in co-relation 609. Up to 288 conditions per place. [2024-06-04 16:30:17,469 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 23 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-04 16:30:17,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 121 flow [2024-06-04 16:30:17,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:30:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:30:17,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2024-06-04 16:30:17,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2024-06-04 16:30:17,480 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 55 transitions. [2024-06-04 16:30:17,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 121 flow [2024-06-04 16:30:17,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 16:30:17,484 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2024-06-04 16:30:17,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-04 16:30:17,488 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-04 16:30:17,488 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2024-06-04 16:30:17,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:17,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:17,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:17,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 16:30:17,489 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-04 16:30:17,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:17,490 INFO L85 PathProgramCache]: Analyzing trace with hash 698380346, now seen corresponding path program 1 times [2024-06-04 16:30:17,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:17,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992709448] [2024-06-04 16:30:17,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:17,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:20,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:20,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992709448] [2024-06-04 16:30:20,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992709448] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:20,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:20,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 16:30:20,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614438637] [2024-06-04 16:30:20,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:20,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:30:20,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:20,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:30:20,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:30:20,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-04 16:30:20,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:20,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:20,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-04 16:30:20,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:20,327 INFO L124 PetriNetUnfolderBase]: 159/307 cut-off events. [2024-06-04 16:30:20,327 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-06-04 16:30:20,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 307 events. 159/307 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1169 event pairs, 79 based on Foata normal form. 2/308 useless extension candidates. Maximal degree in co-relation 682. Up to 274 conditions per place. [2024-06-04 16:30:20,330 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 27 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-04 16:30:20,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 163 flow [2024-06-04 16:30:20,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:30:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:30:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2024-06-04 16:30:20,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546875 [2024-06-04 16:30:20,332 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 4 states and 70 transitions. [2024-06-04 16:30:20,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 163 flow [2024-06-04 16:30:20,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:30:20,333 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 97 flow [2024-06-04 16:30:20,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-04 16:30:20,334 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-04 16:30:20,334 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 97 flow [2024-06-04 16:30:20,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:20,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:20,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:20,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 16:30:20,335 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-04 16:30:20,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:20,336 INFO L85 PathProgramCache]: Analyzing trace with hash 173167718, now seen corresponding path program 1 times [2024-06-04 16:30:20,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:20,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396027916] [2024-06-04 16:30:20,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:20,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:23,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-04 16:30:23,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:23,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396027916] [2024-06-04 16:30:23,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396027916] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:23,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:23,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:30:23,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50202989] [2024-06-04 16:30:23,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:23,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:30:23,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:23,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:30:23,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:30:23,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-04 16:30:23,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:23,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:23,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-04 16:30:23,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:24,194 INFO L124 PetriNetUnfolderBase]: 153/301 cut-off events. [2024-06-04 16:30:24,194 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2024-06-04 16:30:24,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 301 events. 153/301 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1116 event pairs, 43 based on Foata normal form. 4/304 useless extension candidates. Maximal degree in co-relation 733. Up to 246 conditions per place. [2024-06-04 16:30:24,198 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 32 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-04 16:30:24,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 215 flow [2024-06-04 16:30:24,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:30:24,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:30:24,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2024-06-04 16:30:24,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375 [2024-06-04 16:30:24,203 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 97 flow. Second operand 5 states and 86 transitions. [2024-06-04 16:30:24,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 215 flow [2024-06-04 16:30:24,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 206 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-04 16:30:24,207 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 121 flow [2024-06-04 16:30:24,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-04 16:30:24,208 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-04 16:30:24,208 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 121 flow [2024-06-04 16:30:24,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:24,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:24,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:24,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 16:30:24,209 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-04 16:30:24,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:24,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1532684601, now seen corresponding path program 1 times [2024-06-04 16:30:24,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:24,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331367427] [2024-06-04 16:30:24,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:24,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:29,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-04 16:30:29,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:29,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331367427] [2024-06-04 16:30:29,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331367427] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:29,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:29,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:30:29,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777948852] [2024-06-04 16:30:29,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:29,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:30:29,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:29,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:30:29,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:30:29,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:30:29,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:29,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:29,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:30:29,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:29,504 INFO L124 PetriNetUnfolderBase]: 211/380 cut-off events. [2024-06-04 16:30:29,505 INFO L125 PetriNetUnfolderBase]: For 353/353 co-relation queries the response was YES. [2024-06-04 16:30:29,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 380 events. 211/380 cut-off events. For 353/353 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1339 event pairs, 92 based on Foata normal form. 1/380 useless extension candidates. Maximal degree in co-relation 1037. Up to 368 conditions per place. [2024-06-04 16:30:29,507 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 29 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2024-06-04 16:30:29,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 209 flow [2024-06-04 16:30:29,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:30:29,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:30:29,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2024-06-04 16:30:29,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-04 16:30:29,511 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 121 flow. Second operand 5 states and 62 transitions. [2024-06-04 16:30:29,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 209 flow [2024-06-04 16:30:29,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 194 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 16:30:29,513 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 133 flow [2024-06-04 16:30:29,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2024-06-04 16:30:29,515 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-06-04 16:30:29,515 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 133 flow [2024-06-04 16:30:29,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:29,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:29,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:29,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 16:30:29,515 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-04 16:30:29,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:29,516 INFO L85 PathProgramCache]: Analyzing trace with hash 584721724, now seen corresponding path program 1 times [2024-06-04 16:30:29,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:29,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726318983] [2024-06-04 16:30:29,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:29,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:33,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:33,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:33,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726318983] [2024-06-04 16:30:33,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726318983] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:33,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:33,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:30:33,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206920158] [2024-06-04 16:30:33,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:33,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:30:33,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:33,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:30:33,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:30:33,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 16:30:33,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 133 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:33,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:33,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 16:30:33,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:33,625 INFO L124 PetriNetUnfolderBase]: 190/355 cut-off events. [2024-06-04 16:30:33,626 INFO L125 PetriNetUnfolderBase]: For 526/526 co-relation queries the response was YES. [2024-06-04 16:30:33,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 355 events. 190/355 cut-off events. For 526/526 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1259 event pairs, 34 based on Foata normal form. 4/358 useless extension candidates. Maximal degree in co-relation 1002. Up to 272 conditions per place. [2024-06-04 16:30:33,628 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 38 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2024-06-04 16:30:33,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 273 flow [2024-06-04 16:30:33,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:30:33,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:30:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2024-06-04 16:30:33,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2024-06-04 16:30:33,630 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 133 flow. Second operand 7 states and 105 transitions. [2024-06-04 16:30:33,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 273 flow [2024-06-04 16:30:33,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 262 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 16:30:33,632 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 149 flow [2024-06-04 16:30:33,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=149, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2024-06-04 16:30:33,632 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2024-06-04 16:30:33,633 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 149 flow [2024-06-04 16:30:33,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:33,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:33,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:33,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 16:30:33,633 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-04 16:30:33,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:33,634 INFO L85 PathProgramCache]: Analyzing trace with hash -268581436, now seen corresponding path program 1 times [2024-06-04 16:30:33,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:33,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075284409] [2024-06-04 16:30:33,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:33,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:38,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:38,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:38,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075284409] [2024-06-04 16:30:38,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075284409] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:38,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:38,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:30:38,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066337408] [2024-06-04 16:30:38,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:38,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:30:38,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:38,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:30:38,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:30:38,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:30:38,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 149 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:38,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:38,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:30:38,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:38,799 INFO L124 PetriNetUnfolderBase]: 201/363 cut-off events. [2024-06-04 16:30:38,800 INFO L125 PetriNetUnfolderBase]: For 701/701 co-relation queries the response was YES. [2024-06-04 16:30:38,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 363 events. 201/363 cut-off events. For 701/701 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1230 event pairs, 67 based on Foata normal form. 3/365 useless extension candidates. Maximal degree in co-relation 1114. Up to 342 conditions per place. [2024-06-04 16:30:38,802 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 33 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2024-06-04 16:30:38,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 257 flow [2024-06-04 16:30:38,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:30:38,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:30:38,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2024-06-04 16:30:38,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 16:30:38,804 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 149 flow. Second operand 6 states and 72 transitions. [2024-06-04 16:30:38,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 257 flow [2024-06-04 16:30:38,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 235 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 16:30:38,806 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 160 flow [2024-06-04 16:30:38,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2024-06-04 16:30:38,807 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-06-04 16:30:38,807 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 160 flow [2024-06-04 16:30:38,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:38,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:38,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:38,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 16:30:38,809 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-04 16:30:38,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:38,810 INFO L85 PathProgramCache]: Analyzing trace with hash 636740918, now seen corresponding path program 1 times [2024-06-04 16:30:38,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:38,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26116746] [2024-06-04 16:30:38,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:38,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:43,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:43,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:43,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26116746] [2024-06-04 16:30:43,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26116746] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:43,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:43,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:30:43,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827643648] [2024-06-04 16:30:43,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:43,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:30:43,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:43,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:30:43,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:30:43,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:30:43,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 160 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:43,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:43,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:30:43,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:43,683 INFO L124 PetriNetUnfolderBase]: 204/368 cut-off events. [2024-06-04 16:30:43,683 INFO L125 PetriNetUnfolderBase]: For 854/854 co-relation queries the response was YES. [2024-06-04 16:30:43,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 368 events. 204/368 cut-off events. For 854/854 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1259 event pairs, 67 based on Foata normal form. 1/368 useless extension candidates. Maximal degree in co-relation 1181. Up to 340 conditions per place. [2024-06-04 16:30:43,685 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 36 selfloop transitions, 11 changer transitions 0/49 dead transitions. [2024-06-04 16:30:43,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 306 flow [2024-06-04 16:30:43,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:30:43,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:30:43,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2024-06-04 16:30:43,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-04 16:30:43,687 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 160 flow. Second operand 6 states and 76 transitions. [2024-06-04 16:30:43,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 306 flow [2024-06-04 16:30:43,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 289 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 16:30:43,689 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 190 flow [2024-06-04 16:30:43,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-06-04 16:30:43,689 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2024-06-04 16:30:43,690 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 190 flow [2024-06-04 16:30:43,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:43,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:43,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:43,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 16:30:43,690 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-04 16:30:43,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:43,691 INFO L85 PathProgramCache]: Analyzing trace with hash 293395208, now seen corresponding path program 2 times [2024-06-04 16:30:43,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:43,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359214852] [2024-06-04 16:30:43,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:43,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:47,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:47,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359214852] [2024-06-04 16:30:47,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359214852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:47,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:47,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:30:47,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215181283] [2024-06-04 16:30:47,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:47,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:30:47,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:47,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:30:47,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:30:47,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:30:47,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 190 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:47,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:47,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:30:47,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:48,101 INFO L124 PetriNetUnfolderBase]: 202/365 cut-off events. [2024-06-04 16:30:48,101 INFO L125 PetriNetUnfolderBase]: For 1087/1087 co-relation queries the response was YES. [2024-06-04 16:30:48,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1257 conditions, 365 events. 202/365 cut-off events. For 1087/1087 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1241 event pairs, 66 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 1233. Up to 350 conditions per place. [2024-06-04 16:30:48,104 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 35 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2024-06-04 16:30:48,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 290 flow [2024-06-04 16:30:48,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:30:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:30:48,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2024-06-04 16:30:48,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-04 16:30:48,105 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 190 flow. Second operand 6 states and 70 transitions. [2024-06-04 16:30:48,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 290 flow [2024-06-04 16:30:48,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 278 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-04 16:30:48,107 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 199 flow [2024-06-04 16:30:48,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2024-06-04 16:30:48,108 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2024-06-04 16:30:48,108 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 199 flow [2024-06-04 16:30:48,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:48,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:48,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:48,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 16:30:48,109 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-04 16:30:48,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:48,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1965014730, now seen corresponding path program 1 times [2024-06-04 16:30:48,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:48,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669807243] [2024-06-04 16:30:48,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:48,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:53,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:53,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669807243] [2024-06-04 16:30:53,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669807243] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:53,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:53,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:30:53,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492282969] [2024-06-04 16:30:53,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:53,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:30:53,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:53,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:30:53,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:30:53,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:30:53,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 199 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:53,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:53,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:30:53,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:53,680 INFO L124 PetriNetUnfolderBase]: 205/370 cut-off events. [2024-06-04 16:30:53,680 INFO L125 PetriNetUnfolderBase]: For 1395/1395 co-relation queries the response was YES. [2024-06-04 16:30:53,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 370 events. 205/370 cut-off events. For 1395/1395 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1266 event pairs, 66 based on Foata normal form. 1/370 useless extension candidates. Maximal degree in co-relation 1299. Up to 325 conditions per place. [2024-06-04 16:30:53,682 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 39 selfloop transitions, 16 changer transitions 0/57 dead transitions. [2024-06-04 16:30:53,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 379 flow [2024-06-04 16:30:53,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:30:53,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:30:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-04 16:30:53,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39732142857142855 [2024-06-04 16:30:53,684 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 199 flow. Second operand 7 states and 89 transitions. [2024-06-04 16:30:53,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 379 flow [2024-06-04 16:30:53,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 358 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-04 16:30:53,686 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 239 flow [2024-06-04 16:30:53,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=239, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2024-06-04 16:30:53,687 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 23 predicate places. [2024-06-04 16:30:53,687 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 239 flow [2024-06-04 16:30:53,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:53,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:53,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:53,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 16:30:53,687 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-04 16:30:53,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:53,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1965164460, now seen corresponding path program 2 times [2024-06-04 16:30:53,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:53,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250324971] [2024-06-04 16:30:53,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:53,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:58,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:58,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:58,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250324971] [2024-06-04 16:30:58,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250324971] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:58,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:58,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:30:58,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936502254] [2024-06-04 16:30:58,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:58,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:30:58,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:58,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:30:58,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:30:58,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:30:58,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 239 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:58,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:58,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:30:58,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:59,053 INFO L124 PetriNetUnfolderBase]: 208/375 cut-off events. [2024-06-04 16:30:59,053 INFO L125 PetriNetUnfolderBase]: For 1767/1767 co-relation queries the response was YES. [2024-06-04 16:30:59,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 375 events. 208/375 cut-off events. For 1767/1767 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1295 event pairs, 66 based on Foata normal form. 1/375 useless extension candidates. Maximal degree in co-relation 1404. Up to 345 conditions per place. [2024-06-04 16:30:59,055 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 40 selfloop transitions, 13 changer transitions 0/55 dead transitions. [2024-06-04 16:30:59,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 383 flow [2024-06-04 16:30:59,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:30:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:30:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2024-06-04 16:30:59,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-04 16:30:59,057 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 239 flow. Second operand 7 states and 91 transitions. [2024-06-04 16:30:59,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 383 flow [2024-06-04 16:30:59,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 358 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-04 16:30:59,060 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 263 flow [2024-06-04 16:30:59,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=263, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2024-06-04 16:30:59,063 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 27 predicate places. [2024-06-04 16:30:59,064 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 263 flow [2024-06-04 16:30:59,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:30:59,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:59,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:59,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 16:30:59,065 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-04 16:30:59,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:59,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1965164677, now seen corresponding path program 1 times [2024-06-04 16:30:59,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:59,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862450670] [2024-06-04 16:30:59,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:59,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:03,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:03,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862450670] [2024-06-04 16:31:03,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862450670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:03,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:03,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:31:03,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845024385] [2024-06-04 16:31:03,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:03,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:31:03,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:03,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:31:03,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:31:04,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:31:04,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 263 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:04,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:04,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:31:04,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:04,383 INFO L124 PetriNetUnfolderBase]: 227/406 cut-off events. [2024-06-04 16:31:04,384 INFO L125 PetriNetUnfolderBase]: For 2330/2330 co-relation queries the response was YES. [2024-06-04 16:31:04,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 406 events. 227/406 cut-off events. For 2330/2330 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1417 event pairs, 69 based on Foata normal form. 3/408 useless extension candidates. Maximal degree in co-relation 1557. Up to 351 conditions per place. [2024-06-04 16:31:04,387 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 49 selfloop transitions, 15 changer transitions 0/66 dead transitions. [2024-06-04 16:31:04,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 471 flow [2024-06-04 16:31:04,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:31:04,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:31:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2024-06-04 16:31:04,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-04 16:31:04,390 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 263 flow. Second operand 7 states and 91 transitions. [2024-06-04 16:31:04,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 471 flow [2024-06-04 16:31:04,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 444 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-04 16:31:04,393 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 310 flow [2024-06-04 16:31:04,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=310, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-06-04 16:31:04,394 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 30 predicate places. [2024-06-04 16:31:04,394 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 310 flow [2024-06-04 16:31:04,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:04,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:04,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:04,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 16:31:04,395 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-04 16:31:04,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:04,396 INFO L85 PathProgramCache]: Analyzing trace with hash 505317578, now seen corresponding path program 3 times [2024-06-04 16:31:04,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:04,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863581609] [2024-06-04 16:31:04,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:04,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:10,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:10,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863581609] [2024-06-04 16:31:10,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863581609] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:10,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:10,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:31:10,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212661709] [2024-06-04 16:31:10,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:10,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:31:10,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:10,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:31:10,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:31:10,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:31:10,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 310 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:10,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:10,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:31:10,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:10,531 INFO L124 PetriNetUnfolderBase]: 225/403 cut-off events. [2024-06-04 16:31:10,531 INFO L125 PetriNetUnfolderBase]: For 2648/2648 co-relation queries the response was YES. [2024-06-04 16:31:10,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 403 events. 225/403 cut-off events. For 2648/2648 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1400 event pairs, 67 based on Foata normal form. 1/403 useless extension candidates. Maximal degree in co-relation 1660. Up to 385 conditions per place. [2024-06-04 16:31:10,534 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 46 selfloop transitions, 10 changer transitions 0/58 dead transitions. [2024-06-04 16:31:10,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 58 transitions, 438 flow [2024-06-04 16:31:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:31:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:31:10,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-04 16:31:10,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35267857142857145 [2024-06-04 16:31:10,536 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 310 flow. Second operand 7 states and 79 transitions. [2024-06-04 16:31:10,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 58 transitions, 438 flow [2024-06-04 16:31:10,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 58 transitions, 425 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-04 16:31:10,540 INFO L231 Difference]: Finished difference. Result has 66 places, 51 transitions, 322 flow [2024-06-04 16:31:10,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=322, PETRI_PLACES=66, PETRI_TRANSITIONS=51} [2024-06-04 16:31:10,542 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2024-06-04 16:31:10,542 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 322 flow [2024-06-04 16:31:10,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:10,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:10,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:10,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 16:31:10,543 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-04 16:31:10,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:10,543 INFO L85 PathProgramCache]: Analyzing trace with hash -408967995, now seen corresponding path program 2 times [2024-06-04 16:31:10,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:10,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703862500] [2024-06-04 16:31:10,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:10,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:14,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:14,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703862500] [2024-06-04 16:31:14,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703862500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:14,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:14,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:31:14,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226920514] [2024-06-04 16:31:14,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:14,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:31:14,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:14,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:31:14,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:31:15,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:31:15,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 51 transitions, 322 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:15,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:15,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:31:15,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:15,388 INFO L124 PetriNetUnfolderBase]: 234/418 cut-off events. [2024-06-04 16:31:15,389 INFO L125 PetriNetUnfolderBase]: For 3282/3282 co-relation queries the response was YES. [2024-06-04 16:31:15,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1791 conditions, 418 events. 234/418 cut-off events. For 3282/3282 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1482 event pairs, 67 based on Foata normal form. 3/420 useless extension candidates. Maximal degree in co-relation 1757. Up to 377 conditions per place. [2024-06-04 16:31:15,391 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 50 selfloop transitions, 13 changer transitions 0/65 dead transitions. [2024-06-04 16:31:15,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 516 flow [2024-06-04 16:31:15,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:31:15,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:31:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-04 16:31:15,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38392857142857145 [2024-06-04 16:31:15,392 INFO L175 Difference]: Start difference. First operand has 66 places, 51 transitions, 322 flow. Second operand 7 states and 86 transitions. [2024-06-04 16:31:15,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 516 flow [2024-06-04 16:31:15,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 65 transitions, 481 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-04 16:31:15,396 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 332 flow [2024-06-04 16:31:15,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=332, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2024-06-04 16:31:15,397 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2024-06-04 16:31:15,397 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 332 flow [2024-06-04 16:31:15,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:15,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:15,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:15,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 16:31:15,398 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-04 16:31:15,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:15,398 INFO L85 PathProgramCache]: Analyzing trace with hash -408701085, now seen corresponding path program 3 times [2024-06-04 16:31:15,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:15,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24756630] [2024-06-04 16:31:15,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:15,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:19,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:19,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:19,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24756630] [2024-06-04 16:31:19,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24756630] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:19,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:19,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:31:19,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063558164] [2024-06-04 16:31:19,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:19,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:31:19,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:19,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:31:19,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:31:19,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:31:19,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 332 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:19,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:19,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:31:19,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:19,904 INFO L124 PetriNetUnfolderBase]: 228/409 cut-off events. [2024-06-04 16:31:19,905 INFO L125 PetriNetUnfolderBase]: For 3560/3560 co-relation queries the response was YES. [2024-06-04 16:31:19,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1762 conditions, 409 events. 228/409 cut-off events. For 3560/3560 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1440 event pairs, 65 based on Foata normal form. 3/411 useless extension candidates. Maximal degree in co-relation 1728. Up to 385 conditions per place. [2024-06-04 16:31:19,907 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 49 selfloop transitions, 12 changer transitions 0/63 dead transitions. [2024-06-04 16:31:19,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 63 transitions, 487 flow [2024-06-04 16:31:19,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:31:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:31:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-04 16:31:19,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 16:31:19,909 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 332 flow. Second operand 8 states and 88 transitions. [2024-06-04 16:31:19,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 63 transitions, 487 flow [2024-06-04 16:31:19,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 63 transitions, 445 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-04 16:31:19,912 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 337 flow [2024-06-04 16:31:19,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=337, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2024-06-04 16:31:19,913 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 39 predicate places. [2024-06-04 16:31:19,913 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 337 flow [2024-06-04 16:31:19,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:19,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:19,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:19,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 16:31:19,914 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-04 16:31:19,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:19,914 INFO L85 PathProgramCache]: Analyzing trace with hash -21190711, now seen corresponding path program 1 times [2024-06-04 16:31:19,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:19,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223735382] [2024-06-04 16:31:19,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:19,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:25,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:25,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223735382] [2024-06-04 16:31:25,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223735382] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:25,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:25,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:31:25,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202766183] [2024-06-04 16:31:25,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:25,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:31:25,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:25,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:31:25,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:31:25,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:31:25,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 337 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:25,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:25,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:31:25,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:25,939 INFO L124 PetriNetUnfolderBase]: 231/414 cut-off events. [2024-06-04 16:31:25,940 INFO L125 PetriNetUnfolderBase]: For 3776/3776 co-relation queries the response was YES. [2024-06-04 16:31:25,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 414 events. 231/414 cut-off events. For 3776/3776 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1471 event pairs, 46 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1764. Up to 375 conditions per place. [2024-06-04 16:31:25,943 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 60 selfloop transitions, 13 changer transitions 0/75 dead transitions. [2024-06-04 16:31:25,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 75 transitions, 545 flow [2024-06-04 16:31:25,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:31:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:31:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-04 16:31:25,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37890625 [2024-06-04 16:31:25,945 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 337 flow. Second operand 8 states and 97 transitions. [2024-06-04 16:31:25,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 75 transitions, 545 flow [2024-06-04 16:31:25,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 75 transitions, 517 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-04 16:31:25,951 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 365 flow [2024-06-04 16:31:25,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=365, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2024-06-04 16:31:25,952 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 42 predicate places. [2024-06-04 16:31:25,952 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 365 flow [2024-06-04 16:31:25,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:25,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:25,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:25,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 16:31:25,953 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-04 16:31:25,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:25,953 INFO L85 PathProgramCache]: Analyzing trace with hash -21185875, now seen corresponding path program 1 times [2024-06-04 16:31:25,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:25,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391766041] [2024-06-04 16:31:25,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:25,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:32,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:32,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:32,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391766041] [2024-06-04 16:31:32,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391766041] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:32,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:32,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:31:32,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42031983] [2024-06-04 16:31:32,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:32,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:31:32,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:32,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:31:32,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:31:32,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:31:32,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 365 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:32,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:32,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:31:32,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:32,633 INFO L124 PetriNetUnfolderBase]: 244/435 cut-off events. [2024-06-04 16:31:32,633 INFO L125 PetriNetUnfolderBase]: For 4479/4479 co-relation queries the response was YES. [2024-06-04 16:31:32,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1968 conditions, 435 events. 244/435 cut-off events. For 4479/4479 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1574 event pairs, 46 based on Foata normal form. 1/435 useless extension candidates. Maximal degree in co-relation 1931. Up to 303 conditions per place. [2024-06-04 16:31:32,636 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 53 selfloop transitions, 30 changer transitions 0/85 dead transitions. [2024-06-04 16:31:32,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 85 transitions, 677 flow [2024-06-04 16:31:32,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:31:32,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:31:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-04 16:31:32,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-04 16:31:32,639 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 365 flow. Second operand 8 states and 108 transitions. [2024-06-04 16:31:32,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 85 transitions, 677 flow [2024-06-04 16:31:32,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 85 transitions, 658 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 16:31:32,645 INFO L231 Difference]: Finished difference. Result has 79 places, 66 transitions, 487 flow [2024-06-04 16:31:32,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=487, PETRI_PLACES=79, PETRI_TRANSITIONS=66} [2024-06-04 16:31:32,645 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 48 predicate places. [2024-06-04 16:31:32,646 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 66 transitions, 487 flow [2024-06-04 16:31:32,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:32,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:32,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:32,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 16:31:32,648 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-04 16:31:32,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:32,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2018047671, now seen corresponding path program 2 times [2024-06-04 16:31:32,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:32,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591801443] [2024-06-04 16:31:32,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:32,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:38,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:38,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:38,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591801443] [2024-06-04 16:31:38,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591801443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:38,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:38,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:31:38,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899570268] [2024-06-04 16:31:38,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:38,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:31:38,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:38,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:31:38,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:31:38,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:31:38,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 66 transitions, 487 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:38,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:38,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:31:38,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:39,007 INFO L124 PetriNetUnfolderBase]: 255/453 cut-off events. [2024-06-04 16:31:39,008 INFO L125 PetriNetUnfolderBase]: For 5602/5602 co-relation queries the response was YES. [2024-06-04 16:31:39,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2312 conditions, 453 events. 255/453 cut-off events. For 5602/5602 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1668 event pairs, 49 based on Foata normal form. 2/454 useless extension candidates. Maximal degree in co-relation 2271. Up to 364 conditions per place. [2024-06-04 16:31:39,012 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 61 selfloop transitions, 26 changer transitions 0/89 dead transitions. [2024-06-04 16:31:39,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 89 transitions, 815 flow [2024-06-04 16:31:39,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:31:39,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:31:39,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-04 16:31:39,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-04 16:31:39,015 INFO L175 Difference]: Start difference. First operand has 79 places, 66 transitions, 487 flow. Second operand 8 states and 104 transitions. [2024-06-04 16:31:39,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 89 transitions, 815 flow [2024-06-04 16:31:39,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 89 transitions, 795 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 16:31:39,022 INFO L231 Difference]: Finished difference. Result has 84 places, 72 transitions, 570 flow [2024-06-04 16:31:39,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=570, PETRI_PLACES=84, PETRI_TRANSITIONS=72} [2024-06-04 16:31:39,023 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 53 predicate places. [2024-06-04 16:31:39,023 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 72 transitions, 570 flow [2024-06-04 16:31:39,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:39,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:39,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:39,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 16:31:39,024 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-04 16:31:39,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:39,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2022689487, now seen corresponding path program 2 times [2024-06-04 16:31:39,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:39,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454025232] [2024-06-04 16:31:39,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:39,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:44,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:44,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:44,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454025232] [2024-06-04 16:31:44,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454025232] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:44,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:44,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:31:44,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075436205] [2024-06-04 16:31:44,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:44,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:31:44,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:44,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:31:44,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:31:44,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:31:44,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 570 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:44,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:44,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:31:44,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:45,136 INFO L124 PetriNetUnfolderBase]: 273/482 cut-off events. [2024-06-04 16:31:45,137 INFO L125 PetriNetUnfolderBase]: For 6615/6615 co-relation queries the response was YES. [2024-06-04 16:31:45,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2592 conditions, 482 events. 273/482 cut-off events. For 6615/6615 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1811 event pairs, 47 based on Foata normal form. 1/482 useless extension candidates. Maximal degree in co-relation 2549. Up to 387 conditions per place. [2024-06-04 16:31:45,140 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 66 selfloop transitions, 27 changer transitions 0/95 dead transitions. [2024-06-04 16:31:45,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 95 transitions, 909 flow [2024-06-04 16:31:45,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:31:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:31:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-04 16:31:45,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2024-06-04 16:31:45,142 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 570 flow. Second operand 8 states and 107 transitions. [2024-06-04 16:31:45,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 95 transitions, 909 flow [2024-06-04 16:31:45,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 95 transitions, 880 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-04 16:31:45,149 INFO L231 Difference]: Finished difference. Result has 90 places, 77 transitions, 644 flow [2024-06-04 16:31:45,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=644, PETRI_PLACES=90, PETRI_TRANSITIONS=77} [2024-06-04 16:31:45,149 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 59 predicate places. [2024-06-04 16:31:45,149 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 77 transitions, 644 flow [2024-06-04 16:31:45,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:45,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:45,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:45,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 16:31:45,150 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-04 16:31:45,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:45,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1621015537, now seen corresponding path program 3 times [2024-06-04 16:31:45,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:45,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724822385] [2024-06-04 16:31:45,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:45,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:50,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:50,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:50,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724822385] [2024-06-04 16:31:50,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724822385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:50,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:50,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:31:50,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818273036] [2024-06-04 16:31:50,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:50,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:31:50,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:50,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:31:50,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:31:50,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:31:50,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 77 transitions, 644 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:50,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:50,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:31:50,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:51,233 INFO L124 PetriNetUnfolderBase]: 267/473 cut-off events. [2024-06-04 16:31:51,233 INFO L125 PetriNetUnfolderBase]: For 7240/7240 co-relation queries the response was YES. [2024-06-04 16:31:51,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2626 conditions, 473 events. 267/473 cut-off events. For 7240/7240 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1765 event pairs, 47 based on Foata normal form. 3/475 useless extension candidates. Maximal degree in co-relation 2580. Up to 388 conditions per place. [2024-06-04 16:31:51,237 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 68 selfloop transitions, 24 changer transitions 0/94 dead transitions. [2024-06-04 16:31:51,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 94 transitions, 916 flow [2024-06-04 16:31:51,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:31:51,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:31:51,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-04 16:31:51,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-04 16:31:51,238 INFO L175 Difference]: Start difference. First operand has 90 places, 77 transitions, 644 flow. Second operand 8 states and 104 transitions. [2024-06-04 16:31:51,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 94 transitions, 916 flow [2024-06-04 16:31:51,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 883 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 16:31:51,252 INFO L231 Difference]: Finished difference. Result has 94 places, 77 transitions, 665 flow [2024-06-04 16:31:51,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=665, PETRI_PLACES=94, PETRI_TRANSITIONS=77} [2024-06-04 16:31:51,253 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 63 predicate places. [2024-06-04 16:31:51,253 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 77 transitions, 665 flow [2024-06-04 16:31:51,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:51,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:51,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:51,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 16:31:51,253 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-04 16:31:51,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:51,254 INFO L85 PathProgramCache]: Analyzing trace with hash -23986311, now seen corresponding path program 3 times [2024-06-04 16:31:51,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:51,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117745835] [2024-06-04 16:31:51,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:51,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:56,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-04 16:31:56,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:56,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117745835] [2024-06-04 16:31:56,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117745835] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:56,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:56,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:31:56,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497145942] [2024-06-04 16:31:56,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:56,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:31:56,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:56,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:31:56,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:31:56,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:31:56,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 77 transitions, 665 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:56,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:56,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:31:56,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:56,608 INFO L124 PetriNetUnfolderBase]: 270/478 cut-off events. [2024-06-04 16:31:56,608 INFO L125 PetriNetUnfolderBase]: For 7636/7636 co-relation queries the response was YES. [2024-06-04 16:31:56,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2748 conditions, 478 events. 270/478 cut-off events. For 7636/7636 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1788 event pairs, 53 based on Foata normal form. 1/478 useless extension candidates. Maximal degree in co-relation 2700. Up to 445 conditions per place. [2024-06-04 16:31:56,612 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 71 selfloop transitions, 16 changer transitions 0/89 dead transitions. [2024-06-04 16:31:56,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 89 transitions, 879 flow [2024-06-04 16:31:56,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:31:56,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:31:56,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-04 16:31:56,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36328125 [2024-06-04 16:31:56,613 INFO L175 Difference]: Start difference. First operand has 94 places, 77 transitions, 665 flow. Second operand 8 states and 93 transitions. [2024-06-04 16:31:56,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 89 transitions, 879 flow [2024-06-04 16:31:56,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 89 transitions, 826 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-04 16:31:56,621 INFO L231 Difference]: Finished difference. Result has 95 places, 79 transitions, 667 flow [2024-06-04 16:31:56,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=667, PETRI_PLACES=95, PETRI_TRANSITIONS=79} [2024-06-04 16:31:56,621 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 64 predicate places. [2024-06-04 16:31:56,622 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 79 transitions, 667 flow [2024-06-04 16:31:56,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:31:56,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:56,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:56,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 16:31:56,622 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-04 16:31:56,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:56,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1506445689, now seen corresponding path program 1 times [2024-06-04 16:31:56,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:56,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497962729] [2024-06-04 16:31:56,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:56,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:01,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-04 16:32:01,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:01,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497962729] [2024-06-04 16:32:01,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497962729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:01,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:01,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:32:01,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796936460] [2024-06-04 16:32:01,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:01,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:32:01,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:01,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:32:01,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:32:01,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:32:01,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 79 transitions, 667 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:01,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:01,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:32:01,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:01,695 INFO L124 PetriNetUnfolderBase]: 266/472 cut-off events. [2024-06-04 16:32:01,695 INFO L125 PetriNetUnfolderBase]: For 8134/8134 co-relation queries the response was YES. [2024-06-04 16:32:01,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2701 conditions, 472 events. 266/472 cut-off events. For 8134/8134 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1754 event pairs, 47 based on Foata normal form. 2/473 useless extension candidates. Maximal degree in co-relation 2652. Up to 443 conditions per place. [2024-06-04 16:32:01,699 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 73 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2024-06-04 16:32:01,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 88 transitions, 859 flow [2024-06-04 16:32:01,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:32:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:32:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2024-06-04 16:32:01,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515625 [2024-06-04 16:32:01,701 INFO L175 Difference]: Start difference. First operand has 95 places, 79 transitions, 667 flow. Second operand 8 states and 90 transitions. [2024-06-04 16:32:01,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 88 transitions, 859 flow [2024-06-04 16:32:01,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 88 transitions, 820 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 16:32:01,708 INFO L231 Difference]: Finished difference. Result has 97 places, 79 transitions, 659 flow [2024-06-04 16:32:01,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=659, PETRI_PLACES=97, PETRI_TRANSITIONS=79} [2024-06-04 16:32:01,709 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 66 predicate places. [2024-06-04 16:32:01,709 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 79 transitions, 659 flow [2024-06-04 16:32:01,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:01,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:01,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:01,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 16:32:01,710 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-04 16:32:01,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:01,710 INFO L85 PathProgramCache]: Analyzing trace with hash -385606735, now seen corresponding path program 4 times [2024-06-04 16:32:01,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:01,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79996575] [2024-06-04 16:32:01,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:01,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:07,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:07,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:07,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79996575] [2024-06-04 16:32:07,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79996575] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:07,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:07,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:32:07,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648604159] [2024-06-04 16:32:07,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:07,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:32:07,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:07,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:32:07,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:32:07,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:32:07,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 79 transitions, 659 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:07,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:07,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:32:07,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:07,572 INFO L124 PetriNetUnfolderBase]: 279/493 cut-off events. [2024-06-04 16:32:07,573 INFO L125 PetriNetUnfolderBase]: For 9068/9068 co-relation queries the response was YES. [2024-06-04 16:32:07,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2865 conditions, 493 events. 279/493 cut-off events. For 9068/9068 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1854 event pairs, 49 based on Foata normal form. 1/493 useless extension candidates. Maximal degree in co-relation 2815. Up to 430 conditions per place. [2024-06-04 16:32:07,576 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 72 selfloop transitions, 20 changer transitions 0/94 dead transitions. [2024-06-04 16:32:07,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 94 transitions, 949 flow [2024-06-04 16:32:07,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:32:07,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:32:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-04 16:32:07,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 16:32:07,578 INFO L175 Difference]: Start difference. First operand has 97 places, 79 transitions, 659 flow. Second operand 8 states and 96 transitions. [2024-06-04 16:32:07,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 94 transitions, 949 flow [2024-06-04 16:32:07,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 901 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 16:32:07,587 INFO L231 Difference]: Finished difference. Result has 99 places, 83 transitions, 702 flow [2024-06-04 16:32:07,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=702, PETRI_PLACES=99, PETRI_TRANSITIONS=83} [2024-06-04 16:32:07,588 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 68 predicate places. [2024-06-04 16:32:07,588 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 83 transitions, 702 flow [2024-06-04 16:32:07,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:07,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:07,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:07,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 16:32:07,589 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-04 16:32:07,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:07,589 INFO L85 PathProgramCache]: Analyzing trace with hash 206894765, now seen corresponding path program 5 times [2024-06-04 16:32:07,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:07,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177874934] [2024-06-04 16:32:07,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:07,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:12,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:12,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:12,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177874934] [2024-06-04 16:32:12,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177874934] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:12,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:12,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:32:12,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171549947] [2024-06-04 16:32:12,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:12,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:32:12,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:12,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:32:12,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:32:12,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:32:12,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 83 transitions, 702 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:12,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:12,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:32:12,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:13,069 INFO L124 PetriNetUnfolderBase]: 288/508 cut-off events. [2024-06-04 16:32:13,069 INFO L125 PetriNetUnfolderBase]: For 10495/10495 co-relation queries the response was YES. [2024-06-04 16:32:13,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3025 conditions, 508 events. 288/508 cut-off events. For 10495/10495 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1931 event pairs, 45 based on Foata normal form. 3/510 useless extension candidates. Maximal degree in co-relation 2973. Up to 447 conditions per place. [2024-06-04 16:32:13,073 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 77 selfloop transitions, 20 changer transitions 0/99 dead transitions. [2024-06-04 16:32:13,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 970 flow [2024-06-04 16:32:13,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:32:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:32:13,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-04 16:32:13,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3828125 [2024-06-04 16:32:13,075 INFO L175 Difference]: Start difference. First operand has 99 places, 83 transitions, 702 flow. Second operand 8 states and 98 transitions. [2024-06-04 16:32:13,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 970 flow [2024-06-04 16:32:13,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 99 transitions, 935 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-04 16:32:13,087 INFO L231 Difference]: Finished difference. Result has 103 places, 86 transitions, 753 flow [2024-06-04 16:32:13,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=753, PETRI_PLACES=103, PETRI_TRANSITIONS=86} [2024-06-04 16:32:13,087 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 72 predicate places. [2024-06-04 16:32:13,087 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 86 transitions, 753 flow [2024-06-04 16:32:13,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:13,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:13,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:13,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 16:32:13,088 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-04 16:32:13,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:13,088 INFO L85 PathProgramCache]: Analyzing trace with hash 206888069, now seen corresponding path program 4 times [2024-06-04 16:32:13,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:13,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648836613] [2024-06-04 16:32:13,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:13,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:18,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:18,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:18,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648836613] [2024-06-04 16:32:18,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648836613] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:18,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:18,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:32:18,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171275004] [2024-06-04 16:32:18,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:18,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:32:18,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:18,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:32:18,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:32:18,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:32:18,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 86 transitions, 753 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:18,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:18,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:32:18,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:18,532 INFO L124 PetriNetUnfolderBase]: 289/510 cut-off events. [2024-06-04 16:32:18,533 INFO L125 PetriNetUnfolderBase]: For 10876/10876 co-relation queries the response was YES. [2024-06-04 16:32:18,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3094 conditions, 510 events. 289/510 cut-off events. For 10876/10876 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1938 event pairs, 54 based on Foata normal form. 2/511 useless extension candidates. Maximal degree in co-relation 3040. Up to 486 conditions per place. [2024-06-04 16:32:18,536 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 81 selfloop transitions, 13 changer transitions 0/96 dead transitions. [2024-06-04 16:32:18,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 96 transitions, 981 flow [2024-06-04 16:32:18,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:32:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:32:18,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-04 16:32:18,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34765625 [2024-06-04 16:32:18,540 INFO L175 Difference]: Start difference. First operand has 103 places, 86 transitions, 753 flow. Second operand 8 states and 89 transitions. [2024-06-04 16:32:18,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 96 transitions, 981 flow [2024-06-04 16:32:18,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 96 transitions, 941 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-04 16:32:18,551 INFO L231 Difference]: Finished difference. Result has 105 places, 88 transitions, 766 flow [2024-06-04 16:32:18,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=766, PETRI_PLACES=105, PETRI_TRANSITIONS=88} [2024-06-04 16:32:18,552 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 74 predicate places. [2024-06-04 16:32:18,552 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 88 transitions, 766 flow [2024-06-04 16:32:18,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:18,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:18,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:18,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 16:32:18,553 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-04 16:32:18,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:18,554 INFO L85 PathProgramCache]: Analyzing trace with hash 215168975, now seen corresponding path program 6 times [2024-06-04 16:32:18,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:18,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524695745] [2024-06-04 16:32:18,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:18,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:23,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:23,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524695745] [2024-06-04 16:32:23,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524695745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:23,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:23,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:32:23,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320860957] [2024-06-04 16:32:23,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:23,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:32:23,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:23,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:32:23,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:32:23,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:32:23,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 88 transitions, 766 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:23,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:23,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:32:23,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:24,329 INFO L124 PetriNetUnfolderBase]: 279/495 cut-off events. [2024-06-04 16:32:24,329 INFO L125 PetriNetUnfolderBase]: For 11174/11174 co-relation queries the response was YES. [2024-06-04 16:32:24,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2920 conditions, 495 events. 279/495 cut-off events. For 11174/11174 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1888 event pairs, 46 based on Foata normal form. 5/499 useless extension candidates. Maximal degree in co-relation 2865. Up to 438 conditions per place. [2024-06-04 16:32:24,333 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 78 selfloop transitions, 19 changer transitions 0/99 dead transitions. [2024-06-04 16:32:24,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 99 transitions, 990 flow [2024-06-04 16:32:24,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:32:24,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:32:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-04 16:32:24,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-04 16:32:24,335 INFO L175 Difference]: Start difference. First operand has 105 places, 88 transitions, 766 flow. Second operand 8 states and 94 transitions. [2024-06-04 16:32:24,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 99 transitions, 990 flow [2024-06-04 16:32:24,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 99 transitions, 955 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 16:32:24,363 INFO L231 Difference]: Finished difference. Result has 107 places, 88 transitions, 778 flow [2024-06-04 16:32:24,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=778, PETRI_PLACES=107, PETRI_TRANSITIONS=88} [2024-06-04 16:32:24,363 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 76 predicate places. [2024-06-04 16:32:24,363 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 88 transitions, 778 flow [2024-06-04 16:32:24,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:24,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:24,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:24,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 16:32:24,368 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-04 16:32:24,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:24,369 INFO L85 PathProgramCache]: Analyzing trace with hash 215476805, now seen corresponding path program 1 times [2024-06-04 16:32:24,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:24,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839327297] [2024-06-04 16:32:24,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:24,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:29,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:29,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839327297] [2024-06-04 16:32:29,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839327297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:29,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:29,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:32:29,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698297489] [2024-06-04 16:32:29,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:29,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:32:29,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:29,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:32:29,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:32:29,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:32:29,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 88 transitions, 778 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:29,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:29,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:32:29,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:29,864 INFO L124 PetriNetUnfolderBase]: 276/490 cut-off events. [2024-06-04 16:32:29,864 INFO L125 PetriNetUnfolderBase]: For 10619/10619 co-relation queries the response was YES. [2024-06-04 16:32:29,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2911 conditions, 490 events. 276/490 cut-off events. For 10619/10619 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1834 event pairs, 47 based on Foata normal form. 2/491 useless extension candidates. Maximal degree in co-relation 2855. Up to 463 conditions per place. [2024-06-04 16:32:29,868 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 83 selfloop transitions, 12 changer transitions 0/97 dead transitions. [2024-06-04 16:32:29,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 97 transitions, 988 flow [2024-06-04 16:32:29,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:32:29,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:32:29,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-04 16:32:29,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 16:32:29,869 INFO L175 Difference]: Start difference. First operand has 107 places, 88 transitions, 778 flow. Second operand 8 states and 88 transitions. [2024-06-04 16:32:29,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 97 transitions, 988 flow [2024-06-04 16:32:29,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 97 transitions, 893 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-04 16:32:29,880 INFO L231 Difference]: Finished difference. Result has 106 places, 88 transitions, 711 flow [2024-06-04 16:32:29,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=711, PETRI_PLACES=106, PETRI_TRANSITIONS=88} [2024-06-04 16:32:29,880 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 75 predicate places. [2024-06-04 16:32:29,880 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 88 transitions, 711 flow [2024-06-04 16:32:29,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:29,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:29,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:29,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 16:32:29,881 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-04 16:32:29,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:29,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1406578453, now seen corresponding path program 1 times [2024-06-04 16:32:29,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:29,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81642830] [2024-06-04 16:32:29,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:29,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:36,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:36,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81642830] [2024-06-04 16:32:36,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81642830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:36,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:36,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:32:36,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035708209] [2024-06-04 16:32:36,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:36,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:32:36,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:36,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:32:36,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:32:36,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:32:36,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 88 transitions, 711 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:36,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:36,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:32:36,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:36,799 INFO L124 PetriNetUnfolderBase]: 274/487 cut-off events. [2024-06-04 16:32:36,799 INFO L125 PetriNetUnfolderBase]: For 10618/10618 co-relation queries the response was YES. [2024-06-04 16:32:36,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2772 conditions, 487 events. 274/487 cut-off events. For 10618/10618 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1834 event pairs, 50 based on Foata normal form. 1/487 useless extension candidates. Maximal degree in co-relation 2717. Up to 434 conditions per place. [2024-06-04 16:32:36,804 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 87 selfloop transitions, 15 changer transitions 0/104 dead transitions. [2024-06-04 16:32:36,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 104 transitions, 961 flow [2024-06-04 16:32:36,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:32:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:32:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-04 16:32:36,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38671875 [2024-06-04 16:32:36,805 INFO L175 Difference]: Start difference. First operand has 106 places, 88 transitions, 711 flow. Second operand 8 states and 99 transitions. [2024-06-04 16:32:36,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 104 transitions, 961 flow [2024-06-04 16:32:36,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 104 transitions, 929 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 16:32:36,818 INFO L231 Difference]: Finished difference. Result has 108 places, 88 transitions, 716 flow [2024-06-04 16:32:36,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=716, PETRI_PLACES=108, PETRI_TRANSITIONS=88} [2024-06-04 16:32:36,819 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 77 predicate places. [2024-06-04 16:32:36,819 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 88 transitions, 716 flow [2024-06-04 16:32:36,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:36,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:36,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:36,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 16:32:36,819 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-04 16:32:36,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:36,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1410149498, now seen corresponding path program 1 times [2024-06-04 16:32:36,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:36,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908132133] [2024-06-04 16:32:36,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:36,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:43,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:43,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:43,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908132133] [2024-06-04 16:32:43,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908132133] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:43,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:43,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:32:43,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611726833] [2024-06-04 16:32:43,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:43,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:32:43,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:43,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:32:43,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:32:43,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:32:43,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 88 transitions, 716 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:43,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:43,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:32:43,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:43,845 INFO L124 PetriNetUnfolderBase]: 277/492 cut-off events. [2024-06-04 16:32:43,845 INFO L125 PetriNetUnfolderBase]: For 11383/11383 co-relation queries the response was YES. [2024-06-04 16:32:43,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2825 conditions, 492 events. 277/492 cut-off events. For 11383/11383 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1867 event pairs, 49 based on Foata normal form. 1/492 useless extension candidates. Maximal degree in co-relation 2769. Up to 450 conditions per place. [2024-06-04 16:32:43,849 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 90 selfloop transitions, 15 changer transitions 0/107 dead transitions. [2024-06-04 16:32:43,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 107 transitions, 988 flow [2024-06-04 16:32:43,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:32:43,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:32:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-04 16:32:43,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2024-06-04 16:32:43,850 INFO L175 Difference]: Start difference. First operand has 108 places, 88 transitions, 716 flow. Second operand 9 states and 106 transitions. [2024-06-04 16:32:43,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 107 transitions, 988 flow [2024-06-04 16:32:43,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 953 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-04 16:32:43,862 INFO L231 Difference]: Finished difference. Result has 110 places, 90 transitions, 734 flow [2024-06-04 16:32:43,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=734, PETRI_PLACES=110, PETRI_TRANSITIONS=90} [2024-06-04 16:32:43,862 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 79 predicate places. [2024-06-04 16:32:43,862 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 90 transitions, 734 flow [2024-06-04 16:32:43,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:43,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:43,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:43,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 16:32:43,863 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-04 16:32:43,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:43,864 INFO L85 PathProgramCache]: Analyzing trace with hash -656761372, now seen corresponding path program 2 times [2024-06-04 16:32:43,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:43,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565828398] [2024-06-04 16:32:43,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:43,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:50,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:50,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:50,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565828398] [2024-06-04 16:32:50,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565828398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:50,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:50,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:32:50,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162087835] [2024-06-04 16:32:50,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:50,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:32:50,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:50,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:32:50,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:32:50,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:32:50,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 90 transitions, 734 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:50,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:50,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:32:50,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:50,557 INFO L124 PetriNetUnfolderBase]: 313/550 cut-off events. [2024-06-04 16:32:50,557 INFO L125 PetriNetUnfolderBase]: For 14844/14844 co-relation queries the response was YES. [2024-06-04 16:32:50,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3289 conditions, 550 events. 313/550 cut-off events. For 14844/14844 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2159 event pairs, 47 based on Foata normal form. 2/551 useless extension candidates. Maximal degree in co-relation 3232. Up to 306 conditions per place. [2024-06-04 16:32:50,560 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 72 selfloop transitions, 46 changer transitions 0/120 dead transitions. [2024-06-04 16:32:50,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 120 transitions, 1226 flow [2024-06-04 16:32:50,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:32:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:32:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-04 16:32:50,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2024-06-04 16:32:50,562 INFO L175 Difference]: Start difference. First operand has 110 places, 90 transitions, 734 flow. Second operand 9 states and 122 transitions. [2024-06-04 16:32:50,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 120 transitions, 1226 flow [2024-06-04 16:32:50,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 120 transitions, 1189 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 16:32:50,577 INFO L231 Difference]: Finished difference. Result has 113 places, 98 transitions, 891 flow [2024-06-04 16:32:50,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=891, PETRI_PLACES=113, PETRI_TRANSITIONS=98} [2024-06-04 16:32:50,580 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 82 predicate places. [2024-06-04 16:32:50,580 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 98 transitions, 891 flow [2024-06-04 16:32:50,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:50,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:50,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:50,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 16:32:50,581 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-04 16:32:50,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:50,581 INFO L85 PathProgramCache]: Analyzing trace with hash -656761155, now seen corresponding path program 1 times [2024-06-04 16:32:50,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:50,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821018168] [2024-06-04 16:32:50,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:50,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:57,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-04 16:32:57,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:57,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821018168] [2024-06-04 16:32:57,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821018168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:57,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:57,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:32:57,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041686629] [2024-06-04 16:32:57,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:57,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:32:57,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:57,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:32:57,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:32:57,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:32:57,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 98 transitions, 891 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:57,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:57,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:32:57,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:58,119 INFO L124 PetriNetUnfolderBase]: 319/560 cut-off events. [2024-06-04 16:32:58,119 INFO L125 PetriNetUnfolderBase]: For 16425/16425 co-relation queries the response was YES. [2024-06-04 16:32:58,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3548 conditions, 560 events. 319/560 cut-off events. For 16425/16425 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2214 event pairs, 51 based on Foata normal form. 2/561 useless extension candidates. Maximal degree in co-relation 3489. Up to 420 conditions per place. [2024-06-04 16:32:58,123 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 82 selfloop transitions, 36 changer transitions 0/120 dead transitions. [2024-06-04 16:32:58,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 120 transitions, 1263 flow [2024-06-04 16:32:58,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:32:58,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:32:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-04 16:32:58,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3993055555555556 [2024-06-04 16:32:58,124 INFO L175 Difference]: Start difference. First operand has 113 places, 98 transitions, 891 flow. Second operand 9 states and 115 transitions. [2024-06-04 16:32:58,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 120 transitions, 1263 flow [2024-06-04 16:32:58,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 120 transitions, 1210 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-04 16:32:58,143 INFO L231 Difference]: Finished difference. Result has 118 places, 102 transitions, 951 flow [2024-06-04 16:32:58,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=951, PETRI_PLACES=118, PETRI_TRANSITIONS=102} [2024-06-04 16:32:58,143 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 87 predicate places. [2024-06-04 16:32:58,143 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 102 transitions, 951 flow [2024-06-04 16:32:58,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:32:58,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:58,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:58,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 16:32:58,144 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-04 16:32:58,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:58,145 INFO L85 PathProgramCache]: Analyzing trace with hash -656766952, now seen corresponding path program 3 times [2024-06-04 16:32:58,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:58,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300451857] [2024-06-04 16:32:58,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:58,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:33:03,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:03,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300451857] [2024-06-04 16:33:03,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300451857] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:03,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:03,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:33:03,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195233302] [2024-06-04 16:33:03,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:03,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:33:03,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:03,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:33:03,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:33:03,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:33:03,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 102 transitions, 951 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:03,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:03,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:33:03,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:04,103 INFO L124 PetriNetUnfolderBase]: 320/562 cut-off events. [2024-06-04 16:33:04,103 INFO L125 PetriNetUnfolderBase]: For 17027/17027 co-relation queries the response was YES. [2024-06-04 16:33:04,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3602 conditions, 562 events. 320/562 cut-off events. For 17027/17027 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2237 event pairs, 46 based on Foata normal form. 2/563 useless extension candidates. Maximal degree in co-relation 3542. Up to 319 conditions per place. [2024-06-04 16:33:04,107 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 77 selfloop transitions, 46 changer transitions 0/125 dead transitions. [2024-06-04 16:33:04,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 125 transitions, 1401 flow [2024-06-04 16:33:04,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:33:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:33:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-04 16:33:04,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2024-06-04 16:33:04,109 INFO L175 Difference]: Start difference. First operand has 118 places, 102 transitions, 951 flow. Second operand 9 states and 123 transitions. [2024-06-04 16:33:04,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 125 transitions, 1401 flow [2024-06-04 16:33:04,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 125 transitions, 1360 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-04 16:33:04,128 INFO L231 Difference]: Finished difference. Result has 122 places, 104 transitions, 1021 flow [2024-06-04 16:33:04,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1021, PETRI_PLACES=122, PETRI_TRANSITIONS=104} [2024-06-04 16:33:04,129 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 91 predicate places. [2024-06-04 16:33:04,129 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 104 transitions, 1021 flow [2024-06-04 16:33:04,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:04,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:04,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:04,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 16:33:04,130 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-04 16:33:04,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:04,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1262332508, now seen corresponding path program 4 times [2024-06-04 16:33:04,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:04,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504949859] [2024-06-04 16:33:04,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:04,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:33:10,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:10,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504949859] [2024-06-04 16:33:10,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504949859] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:10,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:10,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:33:10,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434428646] [2024-06-04 16:33:10,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:10,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:33:10,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:10,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:33:10,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:33:10,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:33:10,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 104 transitions, 1021 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:10,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:10,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:33:10,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:10,485 INFO L124 PetriNetUnfolderBase]: 329/577 cut-off events. [2024-06-04 16:33:10,485 INFO L125 PetriNetUnfolderBase]: For 18920/18920 co-relation queries the response was YES. [2024-06-04 16:33:10,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3813 conditions, 577 events. 329/577 cut-off events. For 18920/18920 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2289 event pairs, 50 based on Foata normal form. 3/579 useless extension candidates. Maximal degree in co-relation 3751. Up to 498 conditions per place. [2024-06-04 16:33:10,489 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 97 selfloop transitions, 24 changer transitions 0/123 dead transitions. [2024-06-04 16:33:10,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 123 transitions, 1335 flow [2024-06-04 16:33:10,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:33:10,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:33:10,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-04 16:33:10,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-04 16:33:10,491 INFO L175 Difference]: Start difference. First operand has 122 places, 104 transitions, 1021 flow. Second operand 9 states and 112 transitions. [2024-06-04 16:33:10,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 123 transitions, 1335 flow [2024-06-04 16:33:10,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 123 transitions, 1248 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-04 16:33:10,515 INFO L231 Difference]: Finished difference. Result has 125 places, 107 transitions, 1026 flow [2024-06-04 16:33:10,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1026, PETRI_PLACES=125, PETRI_TRANSITIONS=107} [2024-06-04 16:33:10,516 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 94 predicate places. [2024-06-04 16:33:10,516 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 107 transitions, 1026 flow [2024-06-04 16:33:10,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:10,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:10,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:10,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 16:33:10,516 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-04 16:33:10,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:10,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1720932563, now seen corresponding path program 2 times [2024-06-04 16:33:10,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:10,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950083991] [2024-06-04 16:33:10,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:10,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:17,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:33:17,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:17,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950083991] [2024-06-04 16:33:17,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950083991] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:17,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:17,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:33:17,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338110057] [2024-06-04 16:33:17,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:17,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:33:17,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:17,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:33:17,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:33:17,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:33:17,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 107 transitions, 1026 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:17,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:17,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:33:17,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:17,924 INFO L124 PetriNetUnfolderBase]: 335/587 cut-off events. [2024-06-04 16:33:17,924 INFO L125 PetriNetUnfolderBase]: For 19386/19386 co-relation queries the response was YES. [2024-06-04 16:33:17,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3876 conditions, 587 events. 335/587 cut-off events. For 19386/19386 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2344 event pairs, 52 based on Foata normal form. 2/588 useless extension candidates. Maximal degree in co-relation 3813. Up to 513 conditions per place. [2024-06-04 16:33:17,928 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 100 selfloop transitions, 23 changer transitions 0/125 dead transitions. [2024-06-04 16:33:17,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 125 transitions, 1330 flow [2024-06-04 16:33:17,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:33:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:33:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-04 16:33:17,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-04 16:33:17,933 INFO L175 Difference]: Start difference. First operand has 125 places, 107 transitions, 1026 flow. Second operand 9 states and 111 transitions. [2024-06-04 16:33:17,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 125 transitions, 1330 flow [2024-06-04 16:33:17,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 125 transitions, 1270 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 16:33:17,957 INFO L231 Difference]: Finished difference. Result has 127 places, 109 transitions, 1039 flow [2024-06-04 16:33:17,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1039, PETRI_PLACES=127, PETRI_TRANSITIONS=109} [2024-06-04 16:33:17,958 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 96 predicate places. [2024-06-04 16:33:17,958 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 109 transitions, 1039 flow [2024-06-04 16:33:17,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:17,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:17,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:17,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 16:33:17,958 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-04 16:33:17,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:17,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1262539898, now seen corresponding path program 5 times [2024-06-04 16:33:17,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:17,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643206843] [2024-06-04 16:33:17,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:17,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:33:24,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:24,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643206843] [2024-06-04 16:33:24,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643206843] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:24,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:24,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:33:24,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038086347] [2024-06-04 16:33:24,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:24,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:33:24,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:24,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:33:24,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:33:24,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:33:24,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 109 transitions, 1039 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:24,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:24,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:33:24,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:24,812 INFO L124 PetriNetUnfolderBase]: 343/600 cut-off events. [2024-06-04 16:33:24,812 INFO L125 PetriNetUnfolderBase]: For 20797/20797 co-relation queries the response was YES. [2024-06-04 16:33:24,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4009 conditions, 600 events. 343/600 cut-off events. For 20797/20797 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2419 event pairs, 50 based on Foata normal form. 1/600 useless extension candidates. Maximal degree in co-relation 3945. Up to 505 conditions per place. [2024-06-04 16:33:24,817 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 96 selfloop transitions, 32 changer transitions 0/130 dead transitions. [2024-06-04 16:33:24,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 130 transitions, 1449 flow [2024-06-04 16:33:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:33:24,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:33:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-04 16:33:24,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-04 16:33:24,818 INFO L175 Difference]: Start difference. First operand has 127 places, 109 transitions, 1039 flow. Second operand 9 states and 116 transitions. [2024-06-04 16:33:24,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 130 transitions, 1449 flow [2024-06-04 16:33:24,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 130 transitions, 1396 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 16:33:24,845 INFO L231 Difference]: Finished difference. Result has 129 places, 113 transitions, 1105 flow [2024-06-04 16:33:24,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1105, PETRI_PLACES=129, PETRI_TRANSITIONS=113} [2024-06-04 16:33:24,845 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 98 predicate places. [2024-06-04 16:33:24,845 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 113 transitions, 1105 flow [2024-06-04 16:33:24,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:24,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:24,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:24,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 16:33:24,846 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-04 16:33:24,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:24,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1721140325, now seen corresponding path program 2 times [2024-06-04 16:33:24,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:24,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503713048] [2024-06-04 16:33:24,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:24,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:30,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:33:30,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:30,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503713048] [2024-06-04 16:33:30,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503713048] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:30,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:30,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:33:30,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077298126] [2024-06-04 16:33:30,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:30,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:33:30,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:30,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:33:30,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:33:30,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:33:30,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 113 transitions, 1105 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:30,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:30,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:33:30,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:31,070 INFO L124 PetriNetUnfolderBase]: 341/597 cut-off events. [2024-06-04 16:33:31,071 INFO L125 PetriNetUnfolderBase]: For 21353/21353 co-relation queries the response was YES. [2024-06-04 16:33:31,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4043 conditions, 597 events. 341/597 cut-off events. For 21353/21353 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2390 event pairs, 59 based on Foata normal form. 1/597 useless extension candidates. Maximal degree in co-relation 3978. Up to 561 conditions per place. [2024-06-04 16:33:31,075 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 104 selfloop transitions, 17 changer transitions 0/123 dead transitions. [2024-06-04 16:33:31,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 123 transitions, 1373 flow [2024-06-04 16:33:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:33:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:33:31,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-04 16:33:31,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-04 16:33:31,078 INFO L175 Difference]: Start difference. First operand has 129 places, 113 transitions, 1105 flow. Second operand 8 states and 94 transitions. [2024-06-04 16:33:31,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 123 transitions, 1373 flow [2024-06-04 16:33:31,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 123 transitions, 1318 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-04 16:33:31,107 INFO L231 Difference]: Finished difference. Result has 132 places, 113 transitions, 1090 flow [2024-06-04 16:33:31,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1090, PETRI_PLACES=132, PETRI_TRANSITIONS=113} [2024-06-04 16:33:31,108 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 101 predicate places. [2024-06-04 16:33:31,108 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 113 transitions, 1090 flow [2024-06-04 16:33:31,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:31,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:31,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:31,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 16:33:31,109 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-04 16:33:31,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:31,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1262534101, now seen corresponding path program 3 times [2024-06-04 16:33:31,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:31,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194792801] [2024-06-04 16:33:31,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:31,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:37,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:33:37,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:37,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194792801] [2024-06-04 16:33:37,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194792801] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:37,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:37,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:33:37,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131881373] [2024-06-04 16:33:37,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:37,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:33:37,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:37,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:33:37,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:33:37,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:33:37,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 113 transitions, 1090 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:37,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:37,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:33:37,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:38,236 INFO L124 PetriNetUnfolderBase]: 347/607 cut-off events. [2024-06-04 16:33:38,237 INFO L125 PetriNetUnfolderBase]: For 23233/23233 co-relation queries the response was YES. [2024-06-04 16:33:38,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4120 conditions, 607 events. 347/607 cut-off events. For 23233/23233 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2459 event pairs, 52 based on Foata normal form. 2/608 useless extension candidates. Maximal degree in co-relation 4053. Up to 521 conditions per place. [2024-06-04 16:33:38,269 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 102 selfloop transitions, 27 changer transitions 0/131 dead transitions. [2024-06-04 16:33:38,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 131 transitions, 1410 flow [2024-06-04 16:33:38,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:33:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:33:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-04 16:33:38,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2024-06-04 16:33:38,271 INFO L175 Difference]: Start difference. First operand has 132 places, 113 transitions, 1090 flow. Second operand 9 states and 122 transitions. [2024-06-04 16:33:38,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 131 transitions, 1410 flow [2024-06-04 16:33:38,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 131 transitions, 1358 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 16:33:38,301 INFO L231 Difference]: Finished difference. Result has 134 places, 115 transitions, 1123 flow [2024-06-04 16:33:38,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1123, PETRI_PLACES=134, PETRI_TRANSITIONS=115} [2024-06-04 16:33:38,302 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 103 predicate places. [2024-06-04 16:33:38,302 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 115 transitions, 1123 flow [2024-06-04 16:33:38,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:38,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:38,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:38,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 16:33:38,302 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-04 16:33:38,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:38,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1262534318, now seen corresponding path program 6 times [2024-06-04 16:33:38,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:38,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27886581] [2024-06-04 16:33:38,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:38,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:33:44,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:44,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27886581] [2024-06-04 16:33:44,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27886581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:44,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:44,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:33:44,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550466227] [2024-06-04 16:33:44,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:44,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:33:44,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:44,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:33:44,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:33:44,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:33:44,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 115 transitions, 1123 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:44,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:44,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:33:44,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:44,607 INFO L124 PetriNetUnfolderBase]: 368/641 cut-off events. [2024-06-04 16:33:44,608 INFO L125 PetriNetUnfolderBase]: For 26277/26277 co-relation queries the response was YES. [2024-06-04 16:33:44,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4488 conditions, 641 events. 368/641 cut-off events. For 26277/26277 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2628 event pairs, 55 based on Foata normal form. 2/642 useless extension candidates. Maximal degree in co-relation 4420. Up to 520 conditions per place. [2024-06-04 16:33:44,612 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 101 selfloop transitions, 36 changer transitions 0/139 dead transitions. [2024-06-04 16:33:44,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 139 transitions, 1666 flow [2024-06-04 16:33:44,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:33:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:33:44,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-04 16:33:44,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131944444444444 [2024-06-04 16:33:44,616 INFO L175 Difference]: Start difference. First operand has 134 places, 115 transitions, 1123 flow. Second operand 9 states and 119 transitions. [2024-06-04 16:33:44,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 139 transitions, 1666 flow [2024-06-04 16:33:44,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 139 transitions, 1595 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-04 16:33:44,652 INFO L231 Difference]: Finished difference. Result has 137 places, 122 transitions, 1232 flow [2024-06-04 16:33:44,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1232, PETRI_PLACES=137, PETRI_TRANSITIONS=122} [2024-06-04 16:33:44,652 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 106 predicate places. [2024-06-04 16:33:44,652 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 122 transitions, 1232 flow [2024-06-04 16:33:44,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:44,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:44,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:44,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 16:33:44,653 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-04 16:33:44,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:44,653 INFO L85 PathProgramCache]: Analyzing trace with hash -783466076, now seen corresponding path program 7 times [2024-06-04 16:33:44,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:44,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932671519] [2024-06-04 16:33:44,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:44,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:50,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-04 16:33:50,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:50,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932671519] [2024-06-04 16:33:50,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932671519] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:50,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:50,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:33:50,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381809597] [2024-06-04 16:33:50,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:50,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:33:50,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:50,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:33:50,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:33:50,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 16:33:50,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 122 transitions, 1232 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:50,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:50,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 16:33:50,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:50,668 INFO L124 PetriNetUnfolderBase]: 398/691 cut-off events. [2024-06-04 16:33:50,668 INFO L125 PetriNetUnfolderBase]: For 33183/33183 co-relation queries the response was YES. [2024-06-04 16:33:50,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4850 conditions, 691 events. 398/691 cut-off events. For 33183/33183 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2909 event pairs, 58 based on Foata normal form. 10/700 useless extension candidates. Maximal degree in co-relation 4780. Up to 596 conditions per place. [2024-06-04 16:33:50,673 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 115 selfloop transitions, 24 changer transitions 0/141 dead transitions. [2024-06-04 16:33:50,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 141 transitions, 1613 flow [2024-06-04 16:33:50,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:33:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:33:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-04 16:33:50,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3368055555555556 [2024-06-04 16:33:50,674 INFO L175 Difference]: Start difference. First operand has 137 places, 122 transitions, 1232 flow. Second operand 9 states and 97 transitions. [2024-06-04 16:33:50,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 141 transitions, 1613 flow [2024-06-04 16:33:50,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 141 transitions, 1578 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 16:33:50,716 INFO L231 Difference]: Finished difference. Result has 142 places, 127 transitions, 1325 flow [2024-06-04 16:33:50,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1325, PETRI_PLACES=142, PETRI_TRANSITIONS=127} [2024-06-04 16:33:50,717 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 111 predicate places. [2024-06-04 16:33:50,717 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 127 transitions, 1325 flow [2024-06-04 16:33:50,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:50,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:50,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:50,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 16:33:50,718 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-04 16:33:50,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:50,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1919695397, now seen corresponding path program 4 times [2024-06-04 16:33:50,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:50,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404369927] [2024-06-04 16:33:50,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:50,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:58,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:33:58,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:58,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404369927] [2024-06-04 16:33:58,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404369927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:58,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:58,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:33:58,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274005827] [2024-06-04 16:33:58,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:58,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:33:58,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:58,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:33:58,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:33:58,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:33:58,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 127 transitions, 1325 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:58,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:58,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:33:58,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:59,198 INFO L124 PetriNetUnfolderBase]: 404/701 cut-off events. [2024-06-04 16:33:59,199 INFO L125 PetriNetUnfolderBase]: For 29683/29683 co-relation queries the response was YES. [2024-06-04 16:33:59,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5055 conditions, 701 events. 404/701 cut-off events. For 29683/29683 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2944 event pairs, 68 based on Foata normal form. 2/702 useless extension candidates. Maximal degree in co-relation 4983. Up to 660 conditions per place. [2024-06-04 16:33:59,204 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 123 selfloop transitions, 16 changer transitions 0/141 dead transitions. [2024-06-04 16:33:59,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 141 transitions, 1657 flow [2024-06-04 16:33:59,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:33:59,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:33:59,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-04 16:33:59,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2024-06-04 16:33:59,229 INFO L175 Difference]: Start difference. First operand has 142 places, 127 transitions, 1325 flow. Second operand 9 states and 102 transitions. [2024-06-04 16:33:59,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 141 transitions, 1657 flow [2024-06-04 16:33:59,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 141 transitions, 1586 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-04 16:33:59,275 INFO L231 Difference]: Finished difference. Result has 144 places, 129 transitions, 1321 flow [2024-06-04 16:33:59,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1321, PETRI_PLACES=144, PETRI_TRANSITIONS=129} [2024-06-04 16:33:59,276 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 113 predicate places. [2024-06-04 16:33:59,276 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 129 transitions, 1321 flow [2024-06-04 16:33:59,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:33:59,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:59,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:59,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 16:33:59,276 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-04 16:33:59,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:59,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2118771172, now seen corresponding path program 8 times [2024-06-04 16:33:59,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:59,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114928517] [2024-06-04 16:33:59,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:59,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:34:05,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:34:05,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:34:05,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114928517] [2024-06-04 16:34:05,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114928517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:34:05,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:34:05,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:34:05,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409989648] [2024-06-04 16:34:05,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:34:05,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:34:05,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:34:05,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:34:05,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:34:05,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:34:05,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 129 transitions, 1321 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:05,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:34:05,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:34:05,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:34:05,455 INFO L124 PetriNetUnfolderBase]: 403/700 cut-off events. [2024-06-04 16:34:05,456 INFO L125 PetriNetUnfolderBase]: For 30429/30429 co-relation queries the response was YES. [2024-06-04 16:34:05,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4951 conditions, 700 events. 403/700 cut-off events. For 30429/30429 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2962 event pairs, 60 based on Foata normal form. 3/702 useless extension candidates. Maximal degree in co-relation 4878. Up to 642 conditions per place. [2024-06-04 16:34:05,461 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 124 selfloop transitions, 20 changer transitions 0/146 dead transitions. [2024-06-04 16:34:05,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 146 transitions, 1689 flow [2024-06-04 16:34:05,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:34:05,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:34:05,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-04 16:34:05,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3715277777777778 [2024-06-04 16:34:05,462 INFO L175 Difference]: Start difference. First operand has 144 places, 129 transitions, 1321 flow. Second operand 9 states and 107 transitions. [2024-06-04 16:34:05,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 146 transitions, 1689 flow [2024-06-04 16:34:05,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 146 transitions, 1635 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-04 16:34:05,505 INFO L231 Difference]: Finished difference. Result has 146 places, 132 transitions, 1365 flow [2024-06-04 16:34:05,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1365, PETRI_PLACES=146, PETRI_TRANSITIONS=132} [2024-06-04 16:34:05,506 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 115 predicate places. [2024-06-04 16:34:05,506 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 132 transitions, 1365 flow [2024-06-04 16:34:05,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:05,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:34:05,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:34:05,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 16:34:05,506 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-04 16:34:05,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:34:05,507 INFO L85 PathProgramCache]: Analyzing trace with hash 2118771389, now seen corresponding path program 5 times [2024-06-04 16:34:05,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:34:05,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162761309] [2024-06-04 16:34:05,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:34:05,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:34:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:34:11,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-04 16:34:11,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:34:11,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162761309] [2024-06-04 16:34:11,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162761309] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:34:11,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:34:11,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:34:11,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103469251] [2024-06-04 16:34:11,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:34:11,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:34:11,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:34:11,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:34:11,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:34:12,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:34:12,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 132 transitions, 1365 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:12,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:34:12,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:34:12,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:34:12,458 INFO L124 PetriNetUnfolderBase]: 409/710 cut-off events. [2024-06-04 16:34:12,458 INFO L125 PetriNetUnfolderBase]: For 31140/31140 co-relation queries the response was YES. [2024-06-04 16:34:12,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5079 conditions, 710 events. 409/710 cut-off events. For 31140/31140 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3005 event pairs, 62 based on Foata normal form. 2/711 useless extension candidates. Maximal degree in co-relation 5005. Up to 657 conditions per place. [2024-06-04 16:34:12,463 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 127 selfloop transitions, 19 changer transitions 0/148 dead transitions. [2024-06-04 16:34:12,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 148 transitions, 1721 flow [2024-06-04 16:34:12,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:34:12,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:34:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-04 16:34:12,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2024-06-04 16:34:12,465 INFO L175 Difference]: Start difference. First operand has 146 places, 132 transitions, 1365 flow. Second operand 9 states and 106 transitions. [2024-06-04 16:34:12,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 148 transitions, 1721 flow [2024-06-04 16:34:12,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 148 transitions, 1651 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-04 16:34:12,510 INFO L231 Difference]: Finished difference. Result has 148 places, 134 transitions, 1372 flow [2024-06-04 16:34:12,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1372, PETRI_PLACES=148, PETRI_TRANSITIONS=134} [2024-06-04 16:34:12,511 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 117 predicate places. [2024-06-04 16:34:12,511 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 134 transitions, 1372 flow [2024-06-04 16:34:12,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:12,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:34:12,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:34:12,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 16:34:12,512 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-04 16:34:12,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:34:12,512 INFO L85 PathProgramCache]: Analyzing trace with hash -237079674, now seen corresponding path program 9 times [2024-06-04 16:34:12,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:34:12,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634007236] [2024-06-04 16:34:12,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:34:12,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:34:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:34:18,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:34:18,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:34:18,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634007236] [2024-06-04 16:34:18,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634007236] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:34:18,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:34:18,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:34:18,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353899116] [2024-06-04 16:34:18,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:34:18,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:34:18,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:34:18,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:34:18,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:34:18,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:34:18,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 134 transitions, 1372 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:18,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:34:18,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:34:18,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:34:19,232 INFO L124 PetriNetUnfolderBase]: 412/715 cut-off events. [2024-06-04 16:34:19,233 INFO L125 PetriNetUnfolderBase]: For 32135/32135 co-relation queries the response was YES. [2024-06-04 16:34:19,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5120 conditions, 715 events. 412/715 cut-off events. For 32135/32135 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3053 event pairs, 56 based on Foata normal form. 1/715 useless extension candidates. Maximal degree in co-relation 5045. Up to 619 conditions per place. [2024-06-04 16:34:19,238 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 120 selfloop transitions, 32 changer transitions 0/154 dead transitions. [2024-06-04 16:34:19,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 154 transitions, 1887 flow [2024-06-04 16:34:19,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:34:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:34:19,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-04 16:34:19,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 16:34:19,239 INFO L175 Difference]: Start difference. First operand has 148 places, 134 transitions, 1372 flow. Second operand 9 states and 108 transitions. [2024-06-04 16:34:19,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 154 transitions, 1887 flow [2024-06-04 16:34:19,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 154 transitions, 1830 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 16:34:19,293 INFO L231 Difference]: Finished difference. Result has 151 places, 141 transitions, 1505 flow [2024-06-04 16:34:19,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1505, PETRI_PLACES=151, PETRI_TRANSITIONS=141} [2024-06-04 16:34:19,295 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 120 predicate places. [2024-06-04 16:34:19,296 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 141 transitions, 1505 flow [2024-06-04 16:34:19,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:19,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:34:19,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:34:19,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 16:34:19,305 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-04 16:34:19,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:34:19,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2118569579, now seen corresponding path program 6 times [2024-06-04 16:34:19,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:34:19,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536431836] [2024-06-04 16:34:19,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:34:19,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:34:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:34:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:34:25,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:34:25,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536431836] [2024-06-04 16:34:25,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536431836] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:34:25,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:34:25,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:34:25,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357166774] [2024-06-04 16:34:25,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:34:25,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:34:25,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:34:25,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:34:25,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:34:25,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:34:25,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 141 transitions, 1505 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:25,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:34:25,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:34:25,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:34:26,184 INFO L124 PetriNetUnfolderBase]: 408/709 cut-off events. [2024-06-04 16:34:26,184 INFO L125 PetriNetUnfolderBase]: For 32859/32859 co-relation queries the response was YES. [2024-06-04 16:34:26,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5116 conditions, 709 events. 408/709 cut-off events. For 32859/32859 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3022 event pairs, 59 based on Foata normal form. 2/710 useless extension candidates. Maximal degree in co-relation 5039. Up to 627 conditions per place. [2024-06-04 16:34:26,189 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 124 selfloop transitions, 27 changer transitions 0/153 dead transitions. [2024-06-04 16:34:26,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 153 transitions, 1835 flow [2024-06-04 16:34:26,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:34:26,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:34:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-04 16:34:26,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-04 16:34:26,197 INFO L175 Difference]: Start difference. First operand has 151 places, 141 transitions, 1505 flow. Second operand 9 states and 114 transitions. [2024-06-04 16:34:26,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 153 transitions, 1835 flow [2024-06-04 16:34:26,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 153 transitions, 1764 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-04 16:34:26,247 INFO L231 Difference]: Finished difference. Result has 155 places, 141 transitions, 1493 flow [2024-06-04 16:34:26,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1493, PETRI_PLACES=155, PETRI_TRANSITIONS=141} [2024-06-04 16:34:26,248 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 124 predicate places. [2024-06-04 16:34:26,248 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 141 transitions, 1493 flow [2024-06-04 16:34:26,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:26,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:34:26,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:34:26,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 16:34:26,249 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-04 16:34:26,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:34:26,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2118569362, now seen corresponding path program 10 times [2024-06-04 16:34:26,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:34:26,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581710388] [2024-06-04 16:34:26,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:34:26,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:34:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:34:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:34:32,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:34:32,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581710388] [2024-06-04 16:34:32,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581710388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:34:32,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:34:32,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:34:32,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137664361] [2024-06-04 16:34:32,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:34:32,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:34:32,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:34:32,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:34:32,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:34:32,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:34:32,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 141 transitions, 1493 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:32,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:34:32,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:34:32,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:34:33,224 INFO L124 PetriNetUnfolderBase]: 406/706 cut-off events. [2024-06-04 16:34:33,224 INFO L125 PetriNetUnfolderBase]: For 32295/32295 co-relation queries the response was YES. [2024-06-04 16:34:33,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5083 conditions, 706 events. 406/706 cut-off events. For 32295/32295 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3013 event pairs, 55 based on Foata normal form. 1/706 useless extension candidates. Maximal degree in co-relation 5004. Up to 611 conditions per place. [2024-06-04 16:34:33,231 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 120 selfloop transitions, 31 changer transitions 0/153 dead transitions. [2024-06-04 16:34:33,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 153 transitions, 1834 flow [2024-06-04 16:34:33,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:34:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:34:33,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-04 16:34:33,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2024-06-04 16:34:33,232 INFO L175 Difference]: Start difference. First operand has 155 places, 141 transitions, 1493 flow. Second operand 9 states and 106 transitions. [2024-06-04 16:34:33,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 153 transitions, 1834 flow [2024-06-04 16:34:33,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 153 transitions, 1705 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-04 16:34:33,308 INFO L231 Difference]: Finished difference. Result has 156 places, 142 transitions, 1444 flow [2024-06-04 16:34:33,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1370, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1444, PETRI_PLACES=156, PETRI_TRANSITIONS=142} [2024-06-04 16:34:33,308 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 125 predicate places. [2024-06-04 16:34:33,309 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 142 transitions, 1444 flow [2024-06-04 16:34:33,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:33,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:34:33,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:34:33,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 16:34:33,309 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-04 16:34:33,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:34:33,310 INFO L85 PathProgramCache]: Analyzing trace with hash -767822428, now seen corresponding path program 1 times [2024-06-04 16:34:33,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:34:33,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354079615] [2024-06-04 16:34:33,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:34:33,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:34:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:34:39,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:34:39,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:34:39,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354079615] [2024-06-04 16:34:39,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354079615] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:34:39,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:34:39,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:34:39,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088977661] [2024-06-04 16:34:39,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:34:39,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:34:39,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:34:39,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:34:39,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:34:40,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:34:40,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 142 transitions, 1444 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:40,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:34:40,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:34:40,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:34:40,880 INFO L124 PetriNetUnfolderBase]: 417/727 cut-off events. [2024-06-04 16:34:40,880 INFO L125 PetriNetUnfolderBase]: For 36405/36405 co-relation queries the response was YES. [2024-06-04 16:34:40,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5199 conditions, 727 events. 417/727 cut-off events. For 36405/36405 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3128 event pairs, 49 based on Foata normal form. 2/728 useless extension candidates. Maximal degree in co-relation 5119. Up to 639 conditions per place. [2024-06-04 16:34:40,885 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 148 selfloop transitions, 19 changer transitions 0/169 dead transitions. [2024-06-04 16:34:40,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 169 transitions, 1958 flow [2024-06-04 16:34:40,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:34:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:34:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-04 16:34:40,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3664772727272727 [2024-06-04 16:34:40,888 INFO L175 Difference]: Start difference. First operand has 156 places, 142 transitions, 1444 flow. Second operand 11 states and 129 transitions. [2024-06-04 16:34:40,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 169 transitions, 1958 flow [2024-06-04 16:34:40,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 169 transitions, 1906 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 16:34:40,958 INFO L231 Difference]: Finished difference. Result has 161 places, 144 transitions, 1460 flow [2024-06-04 16:34:40,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1460, PETRI_PLACES=161, PETRI_TRANSITIONS=144} [2024-06-04 16:34:40,961 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 130 predicate places. [2024-06-04 16:34:40,961 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 144 transitions, 1460 flow [2024-06-04 16:34:40,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:40,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:34:40,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:34:40,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 16:34:40,962 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-04 16:34:40,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:34:40,962 INFO L85 PathProgramCache]: Analyzing trace with hash -2099468398, now seen corresponding path program 1 times [2024-06-04 16:34:40,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:34:40,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669722522] [2024-06-04 16:34:40,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:34:40,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:34:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:34:48,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:34:48,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:34:48,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669722522] [2024-06-04 16:34:48,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669722522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:34:48,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:34:48,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:34:48,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041643652] [2024-06-04 16:34:48,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:34:48,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:34:48,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:34:48,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:34:48,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:34:48,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:34:48,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 144 transitions, 1460 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:48,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:34:48,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:34:48,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:34:49,044 INFO L124 PetriNetUnfolderBase]: 423/737 cut-off events. [2024-06-04 16:34:49,045 INFO L125 PetriNetUnfolderBase]: For 36911/36911 co-relation queries the response was YES. [2024-06-04 16:34:49,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5278 conditions, 737 events. 423/737 cut-off events. For 36911/36911 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3188 event pairs, 65 based on Foata normal form. 1/737 useless extension candidates. Maximal degree in co-relation 5197. Up to 671 conditions per place. [2024-06-04 16:34:49,050 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 146 selfloop transitions, 23 changer transitions 0/171 dead transitions. [2024-06-04 16:34:49,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 171 transitions, 1987 flow [2024-06-04 16:34:49,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:34:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:34:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-04 16:34:49,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-04 16:34:49,051 INFO L175 Difference]: Start difference. First operand has 161 places, 144 transitions, 1460 flow. Second operand 11 states and 131 transitions. [2024-06-04 16:34:49,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 171 transitions, 1987 flow [2024-06-04 16:34:49,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 171 transitions, 1948 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-04 16:34:49,113 INFO L231 Difference]: Finished difference. Result has 167 places, 148 transitions, 1512 flow [2024-06-04 16:34:49,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1512, PETRI_PLACES=167, PETRI_TRANSITIONS=148} [2024-06-04 16:34:49,113 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 136 predicate places. [2024-06-04 16:34:49,113 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 148 transitions, 1512 flow [2024-06-04 16:34:49,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:49,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:34:49,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:34:49,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 16:34:49,114 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-04 16:34:49,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:34:49,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1110473008, now seen corresponding path program 2 times [2024-06-04 16:34:49,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:34:49,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789277042] [2024-06-04 16:34:49,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:34:49,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:34:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:34:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:34:55,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:34:55,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789277042] [2024-06-04 16:34:55,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789277042] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:34:55,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:34:55,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:34:55,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28075354] [2024-06-04 16:34:55,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:34:55,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:34:55,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:34:55,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:34:55,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:34:55,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:34:55,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 148 transitions, 1512 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:55,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:34:55,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:34:55,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:34:56,054 INFO L124 PetriNetUnfolderBase]: 420/732 cut-off events. [2024-06-04 16:34:56,055 INFO L125 PetriNetUnfolderBase]: For 37548/37548 co-relation queries the response was YES. [2024-06-04 16:34:56,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5215 conditions, 732 events. 420/732 cut-off events. For 37548/37548 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3148 event pairs, 64 based on Foata normal form. 2/733 useless extension candidates. Maximal degree in co-relation 5131. Up to 670 conditions per place. [2024-06-04 16:34:56,063 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 146 selfloop transitions, 18 changer transitions 0/166 dead transitions. [2024-06-04 16:34:56,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 166 transitions, 1890 flow [2024-06-04 16:34:56,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:34:56,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:34:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-04 16:34:56,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 16:34:56,065 INFO L175 Difference]: Start difference. First operand has 167 places, 148 transitions, 1512 flow. Second operand 9 states and 108 transitions. [2024-06-04 16:34:56,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 166 transitions, 1890 flow [2024-06-04 16:34:56,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 166 transitions, 1843 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-04 16:34:56,132 INFO L231 Difference]: Finished difference. Result has 168 places, 148 transitions, 1506 flow [2024-06-04 16:34:56,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1465, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1506, PETRI_PLACES=168, PETRI_TRANSITIONS=148} [2024-06-04 16:34:56,132 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 137 predicate places. [2024-06-04 16:34:56,132 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 148 transitions, 1506 flow [2024-06-04 16:34:56,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:34:56,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:34:56,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:34:56,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 16:34:56,133 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-04 16:34:56,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:34:56,133 INFO L85 PathProgramCache]: Analyzing trace with hash -764960694, now seen corresponding path program 2 times [2024-06-04 16:34:56,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:34:56,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888957874] [2024-06-04 16:34:56,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:34:56,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:34:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:35:01,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:01,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888957874] [2024-06-04 16:35:01,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888957874] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:01,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:01,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:35:01,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098830631] [2024-06-04 16:35:01,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:01,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:35:01,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:01,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:35:01,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:35:02,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:35:02,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 148 transitions, 1506 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:02,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:02,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:35:02,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:02,405 INFO L124 PetriNetUnfolderBase]: 423/737 cut-off events. [2024-06-04 16:35:02,405 INFO L125 PetriNetUnfolderBase]: For 38122/38122 co-relation queries the response was YES. [2024-06-04 16:35:02,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5248 conditions, 737 events. 423/737 cut-off events. For 38122/38122 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3178 event pairs, 64 based on Foata normal form. 1/737 useless extension candidates. Maximal degree in co-relation 5164. Up to 692 conditions per place. [2024-06-04 16:35:02,411 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 149 selfloop transitions, 17 changer transitions 0/168 dead transitions. [2024-06-04 16:35:02,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 168 transitions, 1906 flow [2024-06-04 16:35:02,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:35:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:35:02,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 16:35:02,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-04 16:35:02,413 INFO L175 Difference]: Start difference. First operand has 168 places, 148 transitions, 1506 flow. Second operand 10 states and 125 transitions. [2024-06-04 16:35:02,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 168 transitions, 1906 flow [2024-06-04 16:35:02,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 168 transitions, 1868 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-04 16:35:02,497 INFO L231 Difference]: Finished difference. Result has 170 places, 150 transitions, 1529 flow [2024-06-04 16:35:02,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1529, PETRI_PLACES=170, PETRI_TRANSITIONS=150} [2024-06-04 16:35:02,498 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 139 predicate places. [2024-06-04 16:35:02,498 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 150 transitions, 1529 flow [2024-06-04 16:35:02,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:02,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:02,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:02,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 16:35:02,499 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-04 16:35:02,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:02,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2096667052, now seen corresponding path program 1 times [2024-06-04 16:35:02,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:02,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940640054] [2024-06-04 16:35:02,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:02,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:35:09,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:09,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940640054] [2024-06-04 16:35:09,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940640054] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:09,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:09,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:35:09,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608150576] [2024-06-04 16:35:09,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:09,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:35:09,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:09,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:35:09,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:35:09,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:35:09,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 150 transitions, 1529 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:09,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:09,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:35:09,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:09,589 INFO L124 PetriNetUnfolderBase]: 429/747 cut-off events. [2024-06-04 16:35:09,589 INFO L125 PetriNetUnfolderBase]: For 40862/40862 co-relation queries the response was YES. [2024-06-04 16:35:09,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5342 conditions, 747 events. 429/747 cut-off events. For 40862/40862 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3249 event pairs, 63 based on Foata normal form. 2/748 useless extension candidates. Maximal degree in co-relation 5257. Up to 699 conditions per place. [2024-06-04 16:35:09,595 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 152 selfloop transitions, 17 changer transitions 0/171 dead transitions. [2024-06-04 16:35:09,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 171 transitions, 1949 flow [2024-06-04 16:35:09,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:35:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:35:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-04 16:35:09,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-04 16:35:09,600 INFO L175 Difference]: Start difference. First operand has 170 places, 150 transitions, 1529 flow. Second operand 10 states and 116 transitions. [2024-06-04 16:35:09,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 171 transitions, 1949 flow [2024-06-04 16:35:09,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 171 transitions, 1912 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-04 16:35:09,674 INFO L231 Difference]: Finished difference. Result has 172 places, 152 transitions, 1565 flow [2024-06-04 16:35:09,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1565, PETRI_PLACES=172, PETRI_TRANSITIONS=152} [2024-06-04 16:35:09,675 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 141 predicate places. [2024-06-04 16:35:09,675 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 152 transitions, 1565 flow [2024-06-04 16:35:09,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:09,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:09,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:09,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 16:35:09,676 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-04 16:35:09,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:09,676 INFO L85 PathProgramCache]: Analyzing trace with hash -764965344, now seen corresponding path program 3 times [2024-06-04 16:35:09,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:09,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914714478] [2024-06-04 16:35:09,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:09,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:14,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:35:14,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:14,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914714478] [2024-06-04 16:35:14,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914714478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:14,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:14,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:35:14,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840047630] [2024-06-04 16:35:14,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:14,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:35:14,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:14,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:35:14,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:35:15,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:35:15,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 152 transitions, 1565 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:15,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:15,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:35:15,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:15,563 INFO L124 PetriNetUnfolderBase]: 427/744 cut-off events. [2024-06-04 16:35:15,563 INFO L125 PetriNetUnfolderBase]: For 40096/40096 co-relation queries the response was YES. [2024-06-04 16:35:15,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5351 conditions, 744 events. 427/744 cut-off events. For 40096/40096 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3225 event pairs, 63 based on Foata normal form. 1/744 useless extension candidates. Maximal degree in co-relation 5265. Up to 693 conditions per place. [2024-06-04 16:35:15,570 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 148 selfloop transitions, 21 changer transitions 0/171 dead transitions. [2024-06-04 16:35:15,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 171 transitions, 1955 flow [2024-06-04 16:35:15,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:35:15,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:35:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-04 16:35:15,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-04 16:35:15,572 INFO L175 Difference]: Start difference. First operand has 172 places, 152 transitions, 1565 flow. Second operand 11 states and 135 transitions. [2024-06-04 16:35:15,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 171 transitions, 1955 flow [2024-06-04 16:35:15,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 171 transitions, 1892 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-04 16:35:15,647 INFO L231 Difference]: Finished difference. Result has 175 places, 152 transitions, 1552 flow [2024-06-04 16:35:15,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1552, PETRI_PLACES=175, PETRI_TRANSITIONS=152} [2024-06-04 16:35:15,647 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 144 predicate places. [2024-06-04 16:35:15,647 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 152 transitions, 1552 flow [2024-06-04 16:35:15,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:15,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:15,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:15,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 16:35:15,648 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-04 16:35:15,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:15,649 INFO L85 PathProgramCache]: Analyzing trace with hash -649496358, now seen corresponding path program 2 times [2024-06-04 16:35:15,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:15,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760637861] [2024-06-04 16:35:15,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:15,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:35:22,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:22,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760637861] [2024-06-04 16:35:22,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760637861] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:22,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:22,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:35:22,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063868513] [2024-06-04 16:35:22,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:22,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:35:22,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:22,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:35:22,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:35:22,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:35:22,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 152 transitions, 1552 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:22,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:22,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:35:22,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:22,915 INFO L124 PetriNetUnfolderBase]: 479/828 cut-off events. [2024-06-04 16:35:22,916 INFO L125 PetriNetUnfolderBase]: For 55461/55461 co-relation queries the response was YES. [2024-06-04 16:35:22,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6225 conditions, 828 events. 479/828 cut-off events. For 55461/55461 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3696 event pairs, 45 based on Foata normal form. 4/831 useless extension candidates. Maximal degree in co-relation 6138. Up to 356 conditions per place. [2024-06-04 16:35:22,928 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 118 selfloop transitions, 68 changer transitions 0/188 dead transitions. [2024-06-04 16:35:22,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 188 transitions, 2474 flow [2024-06-04 16:35:22,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:35:22,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:35:22,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-04 16:35:22,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43125 [2024-06-04 16:35:22,930 INFO L175 Difference]: Start difference. First operand has 175 places, 152 transitions, 1552 flow. Second operand 10 states and 138 transitions. [2024-06-04 16:35:22,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 188 transitions, 2474 flow [2024-06-04 16:35:23,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 188 transitions, 2390 flow, removed 5 selfloop flow, removed 12 redundant places. [2024-06-04 16:35:23,037 INFO L231 Difference]: Finished difference. Result has 173 places, 161 transitions, 1744 flow [2024-06-04 16:35:23,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1744, PETRI_PLACES=173, PETRI_TRANSITIONS=161} [2024-06-04 16:35:23,052 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 142 predicate places. [2024-06-04 16:35:23,052 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 161 transitions, 1744 flow [2024-06-04 16:35:23,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:23,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:23,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:23,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 16:35:23,053 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-04 16:35:23,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:23,053 INFO L85 PathProgramCache]: Analyzing trace with hash -649489848, now seen corresponding path program 3 times [2024-06-04 16:35:23,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:23,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113175513] [2024-06-04 16:35:23,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:23,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:35:31,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:31,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113175513] [2024-06-04 16:35:31,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113175513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:31,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:31,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:35:31,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100633679] [2024-06-04 16:35:31,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:31,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:35:31,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:31,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:35:31,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:35:31,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:35:31,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 161 transitions, 1744 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:31,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:31,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:35:31,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:32,159 INFO L124 PetriNetUnfolderBase]: 475/822 cut-off events. [2024-06-04 16:35:32,159 INFO L125 PetriNetUnfolderBase]: For 51695/51695 co-relation queries the response was YES. [2024-06-04 16:35:32,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6283 conditions, 822 events. 475/822 cut-off events. For 51695/51695 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3687 event pairs, 49 based on Foata normal form. 2/823 useless extension candidates. Maximal degree in co-relation 6196. Up to 524 conditions per place. [2024-06-04 16:35:32,166 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 131 selfloop transitions, 61 changer transitions 0/194 dead transitions. [2024-06-04 16:35:32,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 194 transitions, 2579 flow [2024-06-04 16:35:32,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:35:32,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:35:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-04 16:35:32,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-04 16:35:32,167 INFO L175 Difference]: Start difference. First operand has 173 places, 161 transitions, 1744 flow. Second operand 10 states and 130 transitions. [2024-06-04 16:35:32,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 194 transitions, 2579 flow [2024-06-04 16:35:32,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 194 transitions, 2462 flow, removed 42 selfloop flow, removed 4 redundant places. [2024-06-04 16:35:32,249 INFO L231 Difference]: Finished difference. Result has 183 places, 173 transitions, 2027 flow [2024-06-04 16:35:32,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1656, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2027, PETRI_PLACES=183, PETRI_TRANSITIONS=173} [2024-06-04 16:35:32,250 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 152 predicate places. [2024-06-04 16:35:32,250 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 173 transitions, 2027 flow [2024-06-04 16:35:32,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:32,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:32,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:32,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 16:35:32,250 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-04 16:35:32,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:32,251 INFO L85 PathProgramCache]: Analyzing trace with hash -649674298, now seen corresponding path program 3 times [2024-06-04 16:35:32,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:32,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400251784] [2024-06-04 16:35:32,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:32,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:35:38,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:38,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400251784] [2024-06-04 16:35:38,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400251784] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:38,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:38,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:35:38,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97975269] [2024-06-04 16:35:38,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:38,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:35:38,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:38,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:35:38,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:35:38,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:35:38,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 173 transitions, 2027 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:38,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:38,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:35:38,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:38,542 INFO L124 PetriNetUnfolderBase]: 479/830 cut-off events. [2024-06-04 16:35:38,542 INFO L125 PetriNetUnfolderBase]: For 52762/52762 co-relation queries the response was YES. [2024-06-04 16:35:38,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6550 conditions, 830 events. 479/830 cut-off events. For 52762/52762 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3712 event pairs, 73 based on Foata normal form. 2/831 useless extension candidates. Maximal degree in co-relation 6457. Up to 755 conditions per place. [2024-06-04 16:35:38,550 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 160 selfloop transitions, 29 changer transitions 0/191 dead transitions. [2024-06-04 16:35:38,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 191 transitions, 2472 flow [2024-06-04 16:35:38,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:35:38,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:35:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-04 16:35:38,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.365625 [2024-06-04 16:35:38,552 INFO L175 Difference]: Start difference. First operand has 183 places, 173 transitions, 2027 flow. Second operand 10 states and 117 transitions. [2024-06-04 16:35:38,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 191 transitions, 2472 flow [2024-06-04 16:35:38,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 191 transitions, 2385 flow, removed 33 selfloop flow, removed 3 redundant places. [2024-06-04 16:35:38,649 INFO L231 Difference]: Finished difference. Result has 191 places, 175 transitions, 2043 flow [2024-06-04 16:35:38,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1940, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2043, PETRI_PLACES=191, PETRI_TRANSITIONS=175} [2024-06-04 16:35:38,650 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 160 predicate places. [2024-06-04 16:35:38,650 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 175 transitions, 2043 flow [2024-06-04 16:35:38,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:38,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:38,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:38,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 16:35:38,650 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-04 16:35:38,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:38,651 INFO L85 PathProgramCache]: Analyzing trace with hash -649669338, now seen corresponding path program 4 times [2024-06-04 16:35:38,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:38,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743891251] [2024-06-04 16:35:38,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:38,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:35:45,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:45,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743891251] [2024-06-04 16:35:45,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743891251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:45,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:45,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:35:45,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423699450] [2024-06-04 16:35:45,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:45,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:35:45,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:45,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:35:45,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:35:45,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:35:45,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 175 transitions, 2043 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:45,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:45,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:35:45,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:45,786 INFO L124 PetriNetUnfolderBase]: 491/850 cut-off events. [2024-06-04 16:35:45,786 INFO L125 PetriNetUnfolderBase]: For 57452/57452 co-relation queries the response was YES. [2024-06-04 16:35:45,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6652 conditions, 850 events. 491/850 cut-off events. For 57452/57452 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3828 event pairs, 43 based on Foata normal form. 4/853 useless extension candidates. Maximal degree in co-relation 6556. Up to 377 conditions per place. [2024-06-04 16:35:45,793 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 128 selfloop transitions, 75 changer transitions 0/205 dead transitions. [2024-06-04 16:35:45,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 205 transitions, 2984 flow [2024-06-04 16:35:45,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:35:45,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:35:45,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2024-06-04 16:35:45,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44375 [2024-06-04 16:35:45,796 INFO L175 Difference]: Start difference. First operand has 191 places, 175 transitions, 2043 flow. Second operand 10 states and 142 transitions. [2024-06-04 16:35:45,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 205 transitions, 2984 flow [2024-06-04 16:35:45,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 205 transitions, 2898 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-04 16:35:45,912 INFO L231 Difference]: Finished difference. Result has 193 places, 179 transitions, 2167 flow [2024-06-04 16:35:45,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1957, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2167, PETRI_PLACES=193, PETRI_TRANSITIONS=179} [2024-06-04 16:35:45,913 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 162 predicate places. [2024-06-04 16:35:45,913 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 179 transitions, 2167 flow [2024-06-04 16:35:45,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:45,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:45,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:45,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 16:35:45,913 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-04 16:35:45,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:45,914 INFO L85 PathProgramCache]: Analyzing trace with hash -483857224, now seen corresponding path program 5 times [2024-06-04 16:35:45,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:45,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837091876] [2024-06-04 16:35:45,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:45,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:35:51,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:51,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837091876] [2024-06-04 16:35:51,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837091876] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:51,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:51,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:35:51,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460518929] [2024-06-04 16:35:51,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:51,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:35:51,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:51,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:35:51,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:35:52,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:35:52,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 179 transitions, 2167 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:52,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:52,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:35:52,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:52,487 INFO L124 PetriNetUnfolderBase]: 527/908 cut-off events. [2024-06-04 16:35:52,487 INFO L125 PetriNetUnfolderBase]: For 67227/67227 co-relation queries the response was YES. [2024-06-04 16:35:52,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7588 conditions, 908 events. 527/908 cut-off events. For 67227/67227 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4169 event pairs, 63 based on Foata normal form. 2/909 useless extension candidates. Maximal degree in co-relation 7492. Up to 763 conditions per place. [2024-06-04 16:35:52,495 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 169 selfloop transitions, 38 changer transitions 0/209 dead transitions. [2024-06-04 16:35:52,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 209 transitions, 3127 flow [2024-06-04 16:35:52,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:35:52,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:35:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-04 16:35:52,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.409375 [2024-06-04 16:35:52,496 INFO L175 Difference]: Start difference. First operand has 193 places, 179 transitions, 2167 flow. Second operand 10 states and 131 transitions. [2024-06-04 16:35:52,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 209 transitions, 3127 flow [2024-06-04 16:35:52,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 209 transitions, 2968 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-04 16:35:52,603 INFO L231 Difference]: Finished difference. Result has 197 places, 187 transitions, 2269 flow [2024-06-04 16:35:52,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2016, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2269, PETRI_PLACES=197, PETRI_TRANSITIONS=187} [2024-06-04 16:35:52,604 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 166 predicate places. [2024-06-04 16:35:52,604 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 187 transitions, 2269 flow [2024-06-04 16:35:52,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:52,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:52,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:52,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 16:35:52,605 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-04 16:35:52,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:52,605 INFO L85 PathProgramCache]: Analyzing trace with hash -477601114, now seen corresponding path program 6 times [2024-06-04 16:35:52,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:52,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475352546] [2024-06-04 16:35:52,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:52,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:58,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:35:58,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:58,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475352546] [2024-06-04 16:35:58,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475352546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:58,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:58,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:35:58,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096024938] [2024-06-04 16:35:58,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:58,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:35:58,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:58,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:35:58,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:35:58,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:35:58,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 187 transitions, 2269 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:58,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:58,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:35:58,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:59,179 INFO L124 PetriNetUnfolderBase]: 533/918 cut-off events. [2024-06-04 16:35:59,179 INFO L125 PetriNetUnfolderBase]: For 69617/69617 co-relation queries the response was YES. [2024-06-04 16:35:59,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7595 conditions, 918 events. 533/918 cut-off events. For 69617/69617 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4214 event pairs, 66 based on Foata normal form. 2/919 useless extension candidates. Maximal degree in co-relation 7498. Up to 816 conditions per place. [2024-06-04 16:35:59,187 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 177 selfloop transitions, 29 changer transitions 0/208 dead transitions. [2024-06-04 16:35:59,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 208 transitions, 2881 flow [2024-06-04 16:35:59,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:35:59,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:35:59,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-04 16:35:59,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-04 16:35:59,188 INFO L175 Difference]: Start difference. First operand has 197 places, 187 transitions, 2269 flow. Second operand 10 states and 123 transitions. [2024-06-04 16:35:59,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 208 transitions, 2881 flow [2024-06-04 16:35:59,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 208 transitions, 2808 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-04 16:35:59,305 INFO L231 Difference]: Finished difference. Result has 203 places, 189 transitions, 2305 flow [2024-06-04 16:35:59,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2200, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2305, PETRI_PLACES=203, PETRI_TRANSITIONS=189} [2024-06-04 16:35:59,306 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 172 predicate places. [2024-06-04 16:35:59,306 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 189 transitions, 2305 flow [2024-06-04 16:35:59,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:35:59,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:59,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:59,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 16:35:59,306 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-04 16:35:59,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:59,307 INFO L85 PathProgramCache]: Analyzing trace with hash -477601300, now seen corresponding path program 4 times [2024-06-04 16:35:59,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:59,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89559426] [2024-06-04 16:35:59,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:59,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:36:06,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-04 16:36:06,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:36:06,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89559426] [2024-06-04 16:36:06,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89559426] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:36:06,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:36:06,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:36:06,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631150713] [2024-06-04 16:36:06,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:36:06,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:36:06,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:36:06,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:36:06,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:36:06,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:36:06,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 189 transitions, 2305 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:06,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:36:06,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:36:06,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:36:06,786 INFO L124 PetriNetUnfolderBase]: 527/909 cut-off events. [2024-06-04 16:36:06,786 INFO L125 PetriNetUnfolderBase]: For 67811/67811 co-relation queries the response was YES. [2024-06-04 16:36:06,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7403 conditions, 909 events. 527/909 cut-off events. For 67811/67811 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4180 event pairs, 55 based on Foata normal form. 3/911 useless extension candidates. Maximal degree in co-relation 7304. Up to 805 conditions per place. [2024-06-04 16:36:06,792 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 176 selfloop transitions, 30 changer transitions 0/208 dead transitions. [2024-06-04 16:36:06,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 208 transitions, 2763 flow [2024-06-04 16:36:06,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:36:06,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:36:06,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 16:36:06,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-04 16:36:06,794 INFO L175 Difference]: Start difference. First operand has 203 places, 189 transitions, 2305 flow. Second operand 10 states and 125 transitions. [2024-06-04 16:36:06,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 208 transitions, 2763 flow [2024-06-04 16:36:06,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 208 transitions, 2664 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-04 16:36:06,931 INFO L231 Difference]: Finished difference. Result has 205 places, 189 transitions, 2272 flow [2024-06-04 16:36:06,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2206, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2272, PETRI_PLACES=205, PETRI_TRANSITIONS=189} [2024-06-04 16:36:06,932 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 174 predicate places. [2024-06-04 16:36:06,932 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 189 transitions, 2272 flow [2024-06-04 16:36:06,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:06,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:36:06,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:36:06,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 16:36:06,933 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-04 16:36:06,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:36:06,933 INFO L85 PathProgramCache]: Analyzing trace with hash -477594604, now seen corresponding path program 7 times [2024-06-04 16:36:06,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:36:06,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721386041] [2024-06-04 16:36:06,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:36:06,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:36:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:36:15,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-04 16:36:15,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:36:15,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721386041] [2024-06-04 16:36:15,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721386041] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:36:15,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:36:15,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:36:15,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028682137] [2024-06-04 16:36:15,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:36:15,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:36:15,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:36:15,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:36:15,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:36:15,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:36:15,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 189 transitions, 2272 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:15,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:36:15,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:36:15,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:36:15,827 INFO L124 PetriNetUnfolderBase]: 523/903 cut-off events. [2024-06-04 16:36:15,828 INFO L125 PetriNetUnfolderBase]: For 65757/65757 co-relation queries the response was YES. [2024-06-04 16:36:15,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7249 conditions, 903 events. 523/903 cut-off events. For 65757/65757 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4150 event pairs, 65 based on Foata normal form. 2/904 useless extension candidates. Maximal degree in co-relation 7149. Up to 804 conditions per place. [2024-06-04 16:36:15,835 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 176 selfloop transitions, 29 changer transitions 0/207 dead transitions. [2024-06-04 16:36:15,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 207 transitions, 2726 flow [2024-06-04 16:36:15,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:36:15,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:36:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-04 16:36:15,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-04 16:36:15,836 INFO L175 Difference]: Start difference. First operand has 205 places, 189 transitions, 2272 flow. Second operand 10 states and 133 transitions. [2024-06-04 16:36:15,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 207 transitions, 2726 flow [2024-06-04 16:36:15,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 207 transitions, 2629 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-04 16:36:15,958 INFO L231 Difference]: Finished difference. Result has 206 places, 189 transitions, 2238 flow [2024-06-04 16:36:15,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2175, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2238, PETRI_PLACES=206, PETRI_TRANSITIONS=189} [2024-06-04 16:36:15,959 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 175 predicate places. [2024-06-04 16:36:15,959 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 189 transitions, 2238 flow [2024-06-04 16:36:15,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:15,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:36:15,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:36:15,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 16:36:15,960 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-04 16:36:15,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:36:15,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1809061580, now seen corresponding path program 1 times [2024-06-04 16:36:15,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:36:15,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516661742] [2024-06-04 16:36:15,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:36:15,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:36:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:36:21,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:36:21,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:36:21,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516661742] [2024-06-04 16:36:21,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516661742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:36:21,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:36:21,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:36:21,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258370302] [2024-06-04 16:36:21,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:36:21,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:36:21,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:36:21,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:36:21,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:36:21,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:36:21,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 189 transitions, 2238 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:21,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:36:21,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:36:21,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:36:21,925 INFO L124 PetriNetUnfolderBase]: 527/911 cut-off events. [2024-06-04 16:36:21,925 INFO L125 PetriNetUnfolderBase]: For 67489/67489 co-relation queries the response was YES. [2024-06-04 16:36:21,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7274 conditions, 911 events. 527/911 cut-off events. For 67489/67489 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4215 event pairs, 75 based on Foata normal form. 2/912 useless extension candidates. Maximal degree in co-relation 7173. Up to 848 conditions per place. [2024-06-04 16:36:21,933 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 183 selfloop transitions, 21 changer transitions 0/206 dead transitions. [2024-06-04 16:36:21,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 206 transitions, 2712 flow [2024-06-04 16:36:21,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:36:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:36:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-04 16:36:21,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3715277777777778 [2024-06-04 16:36:21,935 INFO L175 Difference]: Start difference. First operand has 206 places, 189 transitions, 2238 flow. Second operand 9 states and 107 transitions. [2024-06-04 16:36:21,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 206 transitions, 2712 flow [2024-06-04 16:36:22,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 206 transitions, 2642 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-04 16:36:22,074 INFO L231 Difference]: Finished difference. Result has 207 places, 192 transitions, 2253 flow [2024-06-04 16:36:22,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2170, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2253, PETRI_PLACES=207, PETRI_TRANSITIONS=192} [2024-06-04 16:36:22,075 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 176 predicate places. [2024-06-04 16:36:22,075 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 192 transitions, 2253 flow [2024-06-04 16:36:22,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:22,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:36:22,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:36:22,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 16:36:22,076 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-04 16:36:22,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:36:22,076 INFO L85 PathProgramCache]: Analyzing trace with hash -483850714, now seen corresponding path program 8 times [2024-06-04 16:36:22,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:36:22,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821617865] [2024-06-04 16:36:22,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:36:22,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:36:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:36:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:36:28,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:36:28,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821617865] [2024-06-04 16:36:28,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821617865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:36:28,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:36:28,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:36:28,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929810027] [2024-06-04 16:36:28,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:36:28,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:36:28,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:36:28,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:36:28,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:36:28,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:36:28,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 192 transitions, 2253 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:28,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:36:28,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:36:28,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:36:29,021 INFO L124 PetriNetUnfolderBase]: 553/953 cut-off events. [2024-06-04 16:36:29,021 INFO L125 PetriNetUnfolderBase]: For 76572/76572 co-relation queries the response was YES. [2024-06-04 16:36:29,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7740 conditions, 953 events. 553/953 cut-off events. For 76572/76572 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4443 event pairs, 68 based on Foata normal form. 2/954 useless extension candidates. Maximal degree in co-relation 7637. Up to 737 conditions per place. [2024-06-04 16:36:29,029 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 167 selfloop transitions, 50 changer transitions 0/219 dead transitions. [2024-06-04 16:36:29,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 219 transitions, 3173 flow [2024-06-04 16:36:29,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:36:29,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:36:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-04 16:36:29,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-04 16:36:29,030 INFO L175 Difference]: Start difference. First operand has 207 places, 192 transitions, 2253 flow. Second operand 10 states and 134 transitions. [2024-06-04 16:36:29,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 219 transitions, 3173 flow [2024-06-04 16:36:29,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 219 transitions, 3101 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-04 16:36:29,194 INFO L231 Difference]: Finished difference. Result has 211 places, 198 transitions, 2380 flow [2024-06-04 16:36:29,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2181, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2380, PETRI_PLACES=211, PETRI_TRANSITIONS=198} [2024-06-04 16:36:29,195 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 180 predicate places. [2024-06-04 16:36:29,195 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 198 transitions, 2380 flow [2024-06-04 16:36:29,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:29,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:36:29,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:36:29,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 16:36:29,196 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-04 16:36:29,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:36:29,196 INFO L85 PathProgramCache]: Analyzing trace with hash -484035164, now seen corresponding path program 4 times [2024-06-04 16:36:29,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:36:29,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814924458] [2024-06-04 16:36:29,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:36:29,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:36:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:36:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:36:36,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:36:36,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814924458] [2024-06-04 16:36:36,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814924458] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:36:36,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:36:36,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:36:36,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637470310] [2024-06-04 16:36:36,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:36:36,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:36:36,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:36:36,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:36:36,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:36:36,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:36:36,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 198 transitions, 2380 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:36,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:36:36,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:36:36,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:36:36,521 INFO L124 PetriNetUnfolderBase]: 557/961 cut-off events. [2024-06-04 16:36:36,521 INFO L125 PetriNetUnfolderBase]: For 79928/79928 co-relation queries the response was YES. [2024-06-04 16:36:36,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7880 conditions, 961 events. 557/961 cut-off events. For 79928/79928 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4493 event pairs, 83 based on Foata normal form. 2/962 useless extension candidates. Maximal degree in co-relation 7776. Up to 919 conditions per place. [2024-06-04 16:36:36,530 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 191 selfloop transitions, 18 changer transitions 0/211 dead transitions. [2024-06-04 16:36:36,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 211 transitions, 2844 flow [2024-06-04 16:36:36,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:36:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:36:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-04 16:36:36,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3576388888888889 [2024-06-04 16:36:36,532 INFO L175 Difference]: Start difference. First operand has 211 places, 198 transitions, 2380 flow. Second operand 9 states and 103 transitions. [2024-06-04 16:36:36,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 211 transitions, 2844 flow [2024-06-04 16:36:36,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 211 transitions, 2798 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-04 16:36:36,699 INFO L231 Difference]: Finished difference. Result has 216 places, 199 transitions, 2392 flow [2024-06-04 16:36:36,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2334, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2392, PETRI_PLACES=216, PETRI_TRANSITIONS=199} [2024-06-04 16:36:36,699 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 185 predicate places. [2024-06-04 16:36:36,700 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 199 transitions, 2392 flow [2024-06-04 16:36:36,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:36,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:36:36,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:36:36,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 16:36:36,700 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-04 16:36:36,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:36:36,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1281295532, now seen corresponding path program 5 times [2024-06-04 16:36:36,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:36:36,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205699254] [2024-06-04 16:36:36,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:36:36,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:36:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:36:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:36:42,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:36:42,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205699254] [2024-06-04 16:36:42,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205699254] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:36:42,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:36:42,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:36:42,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145673928] [2024-06-04 16:36:42,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:36:42,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:36:42,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:36:42,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:36:42,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:36:42,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:36:42,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 199 transitions, 2392 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:42,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:36:42,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:36:42,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:36:43,245 INFO L124 PetriNetUnfolderBase]: 560/966 cut-off events. [2024-06-04 16:36:43,245 INFO L125 PetriNetUnfolderBase]: For 79771/79771 co-relation queries the response was YES. [2024-06-04 16:36:43,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7957 conditions, 966 events. 560/966 cut-off events. For 79771/79771 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4521 event pairs, 61 based on Foata normal form. 1/966 useless extension candidates. Maximal degree in co-relation 7851. Up to 855 conditions per place. [2024-06-04 16:36:43,254 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 178 selfloop transitions, 38 changer transitions 0/218 dead transitions. [2024-06-04 16:36:43,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 218 transitions, 2896 flow [2024-06-04 16:36:43,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:36:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:36:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-04 16:36:43,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-04 16:36:43,255 INFO L175 Difference]: Start difference. First operand has 216 places, 199 transitions, 2392 flow. Second operand 10 states and 126 transitions. [2024-06-04 16:36:43,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 218 transitions, 2896 flow [2024-06-04 16:36:43,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 218 transitions, 2848 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 16:36:43,426 INFO L231 Difference]: Finished difference. Result has 219 places, 201 transitions, 2461 flow [2024-06-04 16:36:43,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2344, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2461, PETRI_PLACES=219, PETRI_TRANSITIONS=201} [2024-06-04 16:36:43,426 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 188 predicate places. [2024-06-04 16:36:43,426 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 201 transitions, 2461 flow [2024-06-04 16:36:43,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:43,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:36:43,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:36:43,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 16:36:43,427 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-04 16:36:43,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:36:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash -484030204, now seen corresponding path program 9 times [2024-06-04 16:36:43,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:36:43,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682819663] [2024-06-04 16:36:43,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:36:43,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:36:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:36:49,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:36:49,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:36:49,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682819663] [2024-06-04 16:36:49,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682819663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:36:49,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:36:49,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:36:49,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698521052] [2024-06-04 16:36:49,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:36:49,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:36:49,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:36:49,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:36:49,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:36:50,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:36:50,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 201 transitions, 2461 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:50,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:36:50,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:36:50,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:36:50,586 INFO L124 PetriNetUnfolderBase]: 574/990 cut-off events. [2024-06-04 16:36:50,586 INFO L125 PetriNetUnfolderBase]: For 88342/88342 co-relation queries the response was YES. [2024-06-04 16:36:50,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8165 conditions, 990 events. 574/990 cut-off events. For 88342/88342 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4674 event pairs, 66 based on Foata normal form. 4/993 useless extension candidates. Maximal degree in co-relation 8058. Up to 764 conditions per place. [2024-06-04 16:36:50,596 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 169 selfloop transitions, 54 changer transitions 0/225 dead transitions. [2024-06-04 16:36:50,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 225 transitions, 3255 flow [2024-06-04 16:36:50,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:36:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:36:50,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-04 16:36:50,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-04 16:36:50,598 INFO L175 Difference]: Start difference. First operand has 219 places, 201 transitions, 2461 flow. Second operand 10 states and 132 transitions. [2024-06-04 16:36:50,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 225 transitions, 3255 flow [2024-06-04 16:36:50,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 225 transitions, 3152 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-04 16:36:50,765 INFO L231 Difference]: Finished difference. Result has 221 places, 205 transitions, 2533 flow [2024-06-04 16:36:50,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2358, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2533, PETRI_PLACES=221, PETRI_TRANSITIONS=205} [2024-06-04 16:36:50,766 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 190 predicate places. [2024-06-04 16:36:50,766 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 205 transitions, 2533 flow [2024-06-04 16:36:50,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:50,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:36:50,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:36:50,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 16:36:50,767 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-04 16:36:50,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:36:50,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1815741584, now seen corresponding path program 6 times [2024-06-04 16:36:50,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:36:50,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541252008] [2024-06-04 16:36:50,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:36:50,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:36:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:36:57,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-04 16:36:57,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:36:57,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541252008] [2024-06-04 16:36:57,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541252008] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:36:57,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:36:57,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:36:57,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165759048] [2024-06-04 16:36:57,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:36:57,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:36:57,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:36:57,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:36:57,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:36:57,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:36:57,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 205 transitions, 2533 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:57,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:36:57,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:36:57,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:36:57,804 INFO L124 PetriNetUnfolderBase]: 570/983 cut-off events. [2024-06-04 16:36:57,805 INFO L125 PetriNetUnfolderBase]: For 84118/84118 co-relation queries the response was YES. [2024-06-04 16:36:57,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8128 conditions, 983 events. 570/983 cut-off events. For 84118/84118 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4632 event pairs, 60 based on Foata normal form. 1/983 useless extension candidates. Maximal degree in co-relation 8020. Up to 852 conditions per place. [2024-06-04 16:36:57,814 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 175 selfloop transitions, 46 changer transitions 0/223 dead transitions. [2024-06-04 16:36:57,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 223 transitions, 3017 flow [2024-06-04 16:36:57,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:36:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:36:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-04 16:36:57,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-04 16:36:57,815 INFO L175 Difference]: Start difference. First operand has 221 places, 205 transitions, 2533 flow. Second operand 10 states and 129 transitions. [2024-06-04 16:36:57,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 223 transitions, 3017 flow [2024-06-04 16:36:57,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 223 transitions, 2910 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-04 16:36:57,982 INFO L231 Difference]: Finished difference. Result has 225 places, 205 transitions, 2523 flow [2024-06-04 16:36:57,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2426, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2523, PETRI_PLACES=225, PETRI_TRANSITIONS=205} [2024-06-04 16:36:57,983 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 194 predicate places. [2024-06-04 16:36:57,983 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 205 transitions, 2523 flow [2024-06-04 16:36:57,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:36:57,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:36:57,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:36:57,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 16:36:57,984 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-04 16:36:57,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:36:57,984 INFO L85 PathProgramCache]: Analyzing trace with hash -575642262, now seen corresponding path program 10 times [2024-06-04 16:36:57,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:36:57,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351324455] [2024-06-04 16:36:57,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:36:57,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:36:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:04,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-04 16:37:04,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:04,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351324455] [2024-06-04 16:37:04,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351324455] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:04,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:04,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:37:04,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844505036] [2024-06-04 16:37:04,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:04,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:37:04,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:04,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:37:04,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:37:04,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:37:04,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 205 transitions, 2523 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:04,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:04,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:37:04,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:05,414 INFO L124 PetriNetUnfolderBase]: 586/1009 cut-off events. [2024-06-04 16:37:05,414 INFO L125 PetriNetUnfolderBase]: For 93104/93104 co-relation queries the response was YES. [2024-06-04 16:37:05,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8469 conditions, 1009 events. 586/1009 cut-off events. For 93104/93104 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4764 event pairs, 77 based on Foata normal form. 2/1010 useless extension candidates. Maximal degree in co-relation 8360. Up to 940 conditions per place. [2024-06-04 16:37:05,424 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 200 selfloop transitions, 22 changer transitions 0/224 dead transitions. [2024-06-04 16:37:05,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 224 transitions, 3221 flow [2024-06-04 16:37:05,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:37:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:37:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-04 16:37:05,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35625 [2024-06-04 16:37:05,425 INFO L175 Difference]: Start difference. First operand has 225 places, 205 transitions, 2523 flow. Second operand 10 states and 114 transitions. [2024-06-04 16:37:05,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 224 transitions, 3221 flow [2024-06-04 16:37:05,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 224 transitions, 3125 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-04 16:37:05,609 INFO L231 Difference]: Finished difference. Result has 227 places, 209 transitions, 2572 flow [2024-06-04 16:37:05,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2427, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2572, PETRI_PLACES=227, PETRI_TRANSITIONS=209} [2024-06-04 16:37:05,610 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 196 predicate places. [2024-06-04 16:37:05,610 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 209 transitions, 2572 flow [2024-06-04 16:37:05,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:05,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:05,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:05,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 16:37:05,611 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-04 16:37:05,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:05,611 INFO L85 PathProgramCache]: Analyzing trace with hash 903941254, now seen corresponding path program 2 times [2024-06-04 16:37:05,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:05,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778612577] [2024-06-04 16:37:05,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:05,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:10,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:37:10,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:10,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778612577] [2024-06-04 16:37:10,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778612577] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:10,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:10,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:37:10,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908807078] [2024-06-04 16:37:10,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:10,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:37:10,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:10,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:37:10,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:37:10,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:37:10,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 209 transitions, 2572 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:10,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:10,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:37:10,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:11,339 INFO L124 PetriNetUnfolderBase]: 590/1017 cut-off events. [2024-06-04 16:37:11,340 INFO L125 PetriNetUnfolderBase]: For 95460/95460 co-relation queries the response was YES. [2024-06-04 16:37:11,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8506 conditions, 1017 events. 590/1017 cut-off events. For 95460/95460 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4838 event pairs, 82 based on Foata normal form. 2/1018 useless extension candidates. Maximal degree in co-relation 8396. Up to 982 conditions per place. [2024-06-04 16:37:11,349 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 205 selfloop transitions, 14 changer transitions 0/221 dead transitions. [2024-06-04 16:37:11,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 221 transitions, 3046 flow [2024-06-04 16:37:11,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:37:11,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:37:11,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-04 16:37:11,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 16:37:11,351 INFO L175 Difference]: Start difference. First operand has 227 places, 209 transitions, 2572 flow. Second operand 9 states and 99 transitions. [2024-06-04 16:37:11,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 221 transitions, 3046 flow [2024-06-04 16:37:11,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 221 transitions, 2966 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-04 16:37:11,575 INFO L231 Difference]: Finished difference. Result has 229 places, 210 transitions, 2538 flow [2024-06-04 16:37:11,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2492, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2538, PETRI_PLACES=229, PETRI_TRANSITIONS=210} [2024-06-04 16:37:11,575 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 198 predicate places. [2024-06-04 16:37:11,575 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 210 transitions, 2538 flow [2024-06-04 16:37:11,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:11,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:11,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:11,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 16:37:11,576 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-04 16:37:11,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:11,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1194358378, now seen corresponding path program 3 times [2024-06-04 16:37:11,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:11,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162205408] [2024-06-04 16:37:11,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:11,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:17,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:37:17,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:17,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162205408] [2024-06-04 16:37:17,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162205408] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:17,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:17,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:37:17,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634269215] [2024-06-04 16:37:17,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:17,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:37:17,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:17,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:37:17,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:37:17,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:37:17,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 210 transitions, 2538 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:17,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:17,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:37:17,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:17,720 INFO L124 PetriNetUnfolderBase]: 597/1030 cut-off events. [2024-06-04 16:37:17,721 INFO L125 PetriNetUnfolderBase]: For 98387/98387 co-relation queries the response was YES. [2024-06-04 16:37:17,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8537 conditions, 1030 events. 597/1030 cut-off events. For 98387/98387 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4938 event pairs, 74 based on Foata normal form. 2/1031 useless extension candidates. Maximal degree in co-relation 8426. Up to 979 conditions per place. [2024-06-04 16:37:17,730 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 206 selfloop transitions, 20 changer transitions 0/228 dead transitions. [2024-06-04 16:37:17,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 228 transitions, 3085 flow [2024-06-04 16:37:17,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:37:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:37:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-04 16:37:17,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3576388888888889 [2024-06-04 16:37:17,733 INFO L175 Difference]: Start difference. First operand has 229 places, 210 transitions, 2538 flow. Second operand 9 states and 103 transitions. [2024-06-04 16:37:17,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 228 transitions, 3085 flow [2024-06-04 16:37:17,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 228 transitions, 3044 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 16:37:17,943 INFO L231 Difference]: Finished difference. Result has 234 places, 217 transitions, 2641 flow [2024-06-04 16:37:17,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2502, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2641, PETRI_PLACES=234, PETRI_TRANSITIONS=217} [2024-06-04 16:37:17,943 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 203 predicate places. [2024-06-04 16:37:17,943 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 217 transitions, 2641 flow [2024-06-04 16:37:17,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:17,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:17,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:17,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 16:37:17,944 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-04 16:37:17,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:17,944 INFO L85 PathProgramCache]: Analyzing trace with hash 619225158, now seen corresponding path program 4 times [2024-06-04 16:37:17,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:17,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950373537] [2024-06-04 16:37:17,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:17,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:37:24,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:24,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950373537] [2024-06-04 16:37:24,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950373537] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:24,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:24,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:37:24,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637829585] [2024-06-04 16:37:24,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:24,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:37:24,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:24,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:37:24,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:37:24,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:37:24,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 217 transitions, 2641 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:24,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:24,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:37:24,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:25,203 INFO L124 PetriNetUnfolderBase]: 601/1038 cut-off events. [2024-06-04 16:37:25,203 INFO L125 PetriNetUnfolderBase]: For 101438/101438 co-relation queries the response was YES. [2024-06-04 16:37:25,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8779 conditions, 1038 events. 601/1038 cut-off events. For 101438/101438 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4981 event pairs, 79 based on Foata normal form. 2/1039 useless extension candidates. Maximal degree in co-relation 8664. Up to 999 conditions per place. [2024-06-04 16:37:25,214 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 211 selfloop transitions, 17 changer transitions 0/230 dead transitions. [2024-06-04 16:37:25,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 230 transitions, 3166 flow [2024-06-04 16:37:25,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:37:25,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:37:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-04 16:37:25,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2024-06-04 16:37:25,221 INFO L175 Difference]: Start difference. First operand has 234 places, 217 transitions, 2641 flow. Second operand 9 states and 101 transitions. [2024-06-04 16:37:25,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 230 transitions, 3166 flow [2024-06-04 16:37:25,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 230 transitions, 3127 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-04 16:37:25,493 INFO L231 Difference]: Finished difference. Result has 239 places, 219 transitions, 2683 flow [2024-06-04 16:37:25,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2603, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2683, PETRI_PLACES=239, PETRI_TRANSITIONS=219} [2024-06-04 16:37:25,494 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 208 predicate places. [2024-06-04 16:37:25,494 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 219 transitions, 2683 flow [2024-06-04 16:37:25,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:25,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:25,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:25,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 16:37:25,495 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-04 16:37:25,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:25,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1250963936, now seen corresponding path program 7 times [2024-06-04 16:37:25,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:25,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079080751] [2024-06-04 16:37:25,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:25,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:37:31,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:31,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079080751] [2024-06-04 16:37:31,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079080751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:31,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:31,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:37:31,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519802530] [2024-06-04 16:37:31,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:31,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:37:31,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:31,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:37:31,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:37:31,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:37:31,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 219 transitions, 2683 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:31,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:31,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:37:31,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:31,967 INFO L124 PetriNetUnfolderBase]: 604/1043 cut-off events. [2024-06-04 16:37:31,967 INFO L125 PetriNetUnfolderBase]: For 102212/102212 co-relation queries the response was YES. [2024-06-04 16:37:31,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8853 conditions, 1043 events. 604/1043 cut-off events. For 102212/102212 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5007 event pairs, 67 based on Foata normal form. 1/1043 useless extension candidates. Maximal degree in co-relation 8737. Up to 871 conditions per place. [2024-06-04 16:37:31,977 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 181 selfloop transitions, 51 changer transitions 0/234 dead transitions. [2024-06-04 16:37:31,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 234 transitions, 3371 flow [2024-06-04 16:37:31,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:37:31,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:37:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-04 16:37:31,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-04 16:37:31,978 INFO L175 Difference]: Start difference. First operand has 239 places, 219 transitions, 2683 flow. Second operand 9 states and 112 transitions. [2024-06-04 16:37:31,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 234 transitions, 3371 flow [2024-06-04 16:37:32,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 234 transitions, 3313 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 16:37:32,267 INFO L231 Difference]: Finished difference. Result has 240 places, 221 transitions, 2772 flow [2024-06-04 16:37:32,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2625, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2772, PETRI_PLACES=240, PETRI_TRANSITIONS=221} [2024-06-04 16:37:32,268 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 209 predicate places. [2024-06-04 16:37:32,268 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 221 transitions, 2772 flow [2024-06-04 16:37:32,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:32,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:32,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:32,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-04 16:37:32,269 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-04 16:37:32,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:32,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1240460708, now seen corresponding path program 5 times [2024-06-04 16:37:32,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:32,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757113624] [2024-06-04 16:37:32,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:32,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:37:38,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:38,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757113624] [2024-06-04 16:37:38,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757113624] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:38,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:38,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:37:38,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719997373] [2024-06-04 16:37:38,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:38,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:37:38,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:38,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:37:38,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:37:38,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:37:38,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 221 transitions, 2772 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:38,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:38,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:37:38,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:39,078 INFO L124 PetriNetUnfolderBase]: 601/1038 cut-off events. [2024-06-04 16:37:39,078 INFO L125 PetriNetUnfolderBase]: For 102483/102483 co-relation queries the response was YES. [2024-06-04 16:37:39,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8796 conditions, 1038 events. 601/1038 cut-off events. For 102483/102483 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4990 event pairs, 89 based on Foata normal form. 2/1039 useless extension candidates. Maximal degree in co-relation 8681. Up to 1008 conditions per place. [2024-06-04 16:37:39,089 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 213 selfloop transitions, 16 changer transitions 0/231 dead transitions. [2024-06-04 16:37:39,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 231 transitions, 3252 flow [2024-06-04 16:37:39,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:37:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:37:39,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-04 16:37:39,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33125 [2024-06-04 16:37:39,090 INFO L175 Difference]: Start difference. First operand has 240 places, 221 transitions, 2772 flow. Second operand 10 states and 106 transitions. [2024-06-04 16:37:39,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 231 transitions, 3252 flow [2024-06-04 16:37:39,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 231 transitions, 3095 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-04 16:37:39,340 INFO L231 Difference]: Finished difference. Result has 241 places, 221 transitions, 2651 flow [2024-06-04 16:37:39,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2615, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2651, PETRI_PLACES=241, PETRI_TRANSITIONS=221} [2024-06-04 16:37:39,340 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 210 predicate places. [2024-06-04 16:37:39,340 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 221 transitions, 2651 flow [2024-06-04 16:37:39,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:39,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:39,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:39,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-04 16:37:39,341 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-04 16:37:39,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:39,341 INFO L85 PathProgramCache]: Analyzing trace with hash 744719384, now seen corresponding path program 11 times [2024-06-04 16:37:39,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:39,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459186162] [2024-06-04 16:37:39,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:39,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:45,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:37:45,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:45,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459186162] [2024-06-04 16:37:45,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459186162] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:45,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:45,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:37:45,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892168704] [2024-06-04 16:37:45,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:45,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:37:45,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:45,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:37:45,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:37:46,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-04 16:37:46,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 221 transitions, 2651 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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-04 16:37:46,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:46,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-04 16:37:46,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:46,570 INFO L124 PetriNetUnfolderBase]: 640/1102 cut-off events. [2024-06-04 16:37:46,570 INFO L125 PetriNetUnfolderBase]: For 118496/118496 co-relation queries the response was YES. [2024-06-04 16:37:46,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9416 conditions, 1102 events. 640/1102 cut-off events. For 118496/118496 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5394 event pairs, 74 based on Foata normal form. 4/1105 useless extension candidates. Maximal degree in co-relation 9303. Up to 981 conditions per place. [2024-06-04 16:37:46,581 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 212 selfloop transitions, 32 changer transitions 0/246 dead transitions. [2024-06-04 16:37:46,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 246 transitions, 3519 flow [2024-06-04 16:37:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:37:46,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:37:46,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-04 16:37:46,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-04 16:37:46,582 INFO L175 Difference]: Start difference. First operand has 241 places, 221 transitions, 2651 flow. Second operand 10 states and 110 transitions. [2024-06-04 16:37:46,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 246 transitions, 3519 flow [2024-06-04 16:37:46,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 246 transitions, 3426 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-04 16:37:46,832 INFO L231 Difference]: Finished difference. Result has 242 places, 230 transitions, 2828 flow [2024-06-04 16:37:46,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2558, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2828, PETRI_PLACES=242, PETRI_TRANSITIONS=230} [2024-06-04 16:37:46,834 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 211 predicate places. [2024-06-04 16:37:46,834 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 230 transitions, 2828 flow [2024-06-04 16:37:46,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 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-04 16:37:46,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:46,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:46,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-04 16:37:46,835 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-04 16:37:46,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:46,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1257397676, now seen corresponding path program 8 times [2024-06-04 16:37:46,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:46,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604026980] [2024-06-04 16:37:46,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:46,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:52,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:37:52,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:52,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604026980] [2024-06-04 16:37:52,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604026980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:52,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:52,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:37:52,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552760508] [2024-06-04 16:37:52,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:52,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:37:52,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:52,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:37:52,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:37:53,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:37:53,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 230 transitions, 2828 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:53,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:53,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:37:53,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:53,725 INFO L124 PetriNetUnfolderBase]: 632/1089 cut-off events. [2024-06-04 16:37:53,725 INFO L125 PetriNetUnfolderBase]: For 113430/113430 co-relation queries the response was YES. [2024-06-04 16:37:53,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9222 conditions, 1089 events. 632/1089 cut-off events. For 113430/113430 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5308 event pairs, 80 based on Foata normal form. 3/1091 useless extension candidates. Maximal degree in co-relation 9108. Up to 1005 conditions per place. [2024-06-04 16:37:53,735 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 211 selfloop transitions, 31 changer transitions 0/244 dead transitions. [2024-06-04 16:37:53,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 244 transitions, 3352 flow [2024-06-04 16:37:53,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:37:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:37:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-04 16:37:53,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 16:37:53,737 INFO L175 Difference]: Start difference. First operand has 242 places, 230 transitions, 2828 flow. Second operand 10 states and 120 transitions. [2024-06-04 16:37:53,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 244 transitions, 3352 flow [2024-06-04 16:37:53,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 244 transitions, 3214 flow, removed 45 selfloop flow, removed 9 redundant places. [2024-06-04 16:37:53,983 INFO L231 Difference]: Finished difference. Result has 243 places, 230 transitions, 2758 flow [2024-06-04 16:37:53,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2690, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2758, PETRI_PLACES=243, PETRI_TRANSITIONS=230} [2024-06-04 16:37:53,984 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 212 predicate places. [2024-06-04 16:37:53,984 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 230 transitions, 2758 flow [2024-06-04 16:37:53,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:37:53,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:53,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:53,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-04 16:37:53,985 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-04 16:37:53,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:53,985 INFO L85 PathProgramCache]: Analyzing trace with hash 618985590, now seen corresponding path program 12 times [2024-06-04 16:37:53,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:53,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054451228] [2024-06-04 16:37:53,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:53,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:01,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:01,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:01,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054451228] [2024-06-04 16:38:01,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054451228] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:01,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:01,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:38:01,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867234022] [2024-06-04 16:38:01,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:01,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:38:01,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:01,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:38:01,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:38:01,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:38:01,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 230 transitions, 2758 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:01,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:01,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:38:01,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:01,760 INFO L124 PetriNetUnfolderBase]: 648/1115 cut-off events. [2024-06-04 16:38:01,760 INFO L125 PetriNetUnfolderBase]: For 115134/115134 co-relation queries the response was YES. [2024-06-04 16:38:01,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9394 conditions, 1115 events. 648/1115 cut-off events. For 115134/115134 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5438 event pairs, 80 based on Foata normal form. 2/1116 useless extension candidates. Maximal degree in co-relation 9281. Up to 1014 conditions per place. [2024-06-04 16:38:01,771 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 218 selfloop transitions, 29 changer transitions 0/249 dead transitions. [2024-06-04 16:38:01,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 249 transitions, 3640 flow [2024-06-04 16:38:01,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:38:01,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:38:01,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-04 16:38:01,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-04 16:38:01,782 INFO L175 Difference]: Start difference. First operand has 243 places, 230 transitions, 2758 flow. Second operand 10 states and 118 transitions. [2024-06-04 16:38:01,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 249 transitions, 3640 flow [2024-06-04 16:38:02,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 249 transitions, 3538 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-04 16:38:02,035 INFO L231 Difference]: Finished difference. Result has 245 places, 234 transitions, 2795 flow [2024-06-04 16:38:02,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2656, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2795, PETRI_PLACES=245, PETRI_TRANSITIONS=234} [2024-06-04 16:38:02,035 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 214 predicate places. [2024-06-04 16:38:02,035 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 234 transitions, 2795 flow [2024-06-04 16:38:02,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:02,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:02,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:02,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-04 16:38:02,036 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-04 16:38:02,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:02,036 INFO L85 PathProgramCache]: Analyzing trace with hash 914800548, now seen corresponding path program 5 times [2024-06-04 16:38:02,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:02,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879582999] [2024-06-04 16:38:02,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:02,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:07,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:07,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:07,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879582999] [2024-06-04 16:38:07,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879582999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:07,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:07,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:38:07,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957702192] [2024-06-04 16:38:07,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:07,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:38:07,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:07,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:38:07,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:38:07,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:38:07,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 234 transitions, 2795 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:07,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:07,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:38:07,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:08,074 INFO L124 PetriNetUnfolderBase]: 645/1110 cut-off events. [2024-06-04 16:38:08,074 INFO L125 PetriNetUnfolderBase]: For 113291/113291 co-relation queries the response was YES. [2024-06-04 16:38:08,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9229 conditions, 1110 events. 645/1110 cut-off events. For 113291/113291 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5405 event pairs, 88 based on Foata normal form. 2/1111 useless extension candidates. Maximal degree in co-relation 9115. Up to 1075 conditions per place. [2024-06-04 16:38:08,085 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 228 selfloop transitions, 14 changer transitions 0/244 dead transitions. [2024-06-04 16:38:08,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 244 transitions, 3301 flow [2024-06-04 16:38:08,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:38:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:38:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-04 16:38:08,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3368055555555556 [2024-06-04 16:38:08,087 INFO L175 Difference]: Start difference. First operand has 245 places, 234 transitions, 2795 flow. Second operand 9 states and 97 transitions. [2024-06-04 16:38:08,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 244 transitions, 3301 flow [2024-06-04 16:38:08,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 244 transitions, 3255 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-04 16:38:08,379 INFO L231 Difference]: Finished difference. Result has 249 places, 234 transitions, 2781 flow [2024-06-04 16:38:08,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2749, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2781, PETRI_PLACES=249, PETRI_TRANSITIONS=234} [2024-06-04 16:38:08,380 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 218 predicate places. [2024-06-04 16:38:08,380 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 234 transitions, 2781 flow [2024-06-04 16:38:08,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:08,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:08,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:08,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-04 16:38:08,381 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-04 16:38:08,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:08,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1194597946, now seen corresponding path program 13 times [2024-06-04 16:38:08,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:08,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116858910] [2024-06-04 16:38:08,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:08,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:15,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:15,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:15,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116858910] [2024-06-04 16:38:15,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116858910] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:15,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:15,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:38:15,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847152547] [2024-06-04 16:38:15,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:15,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:38:15,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:15,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:38:15,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:38:15,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:38:15,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 234 transitions, 2781 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:15,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:15,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:38:15,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:16,013 INFO L124 PetriNetUnfolderBase]: 641/1104 cut-off events. [2024-06-04 16:38:16,013 INFO L125 PetriNetUnfolderBase]: For 111256/111256 co-relation queries the response was YES. [2024-06-04 16:38:16,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9049 conditions, 1104 events. 641/1104 cut-off events. For 111256/111256 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5399 event pairs, 83 based on Foata normal form. 2/1105 useless extension candidates. Maximal degree in co-relation 8933. Up to 1026 conditions per place. [2024-06-04 16:38:16,024 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 220 selfloop transitions, 27 changer transitions 0/249 dead transitions. [2024-06-04 16:38:16,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 249 transitions, 3344 flow [2024-06-04 16:38:16,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:38:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:38:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-04 16:38:16,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-04 16:38:16,025 INFO L175 Difference]: Start difference. First operand has 249 places, 234 transitions, 2781 flow. Second operand 10 states and 118 transitions. [2024-06-04 16:38:16,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 249 transitions, 3344 flow [2024-06-04 16:38:16,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 249 transitions, 3259 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-04 16:38:16,275 INFO L231 Difference]: Finished difference. Result has 250 places, 235 transitions, 2786 flow [2024-06-04 16:38:16,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2696, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2786, PETRI_PLACES=250, PETRI_TRANSITIONS=235} [2024-06-04 16:38:16,276 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 219 predicate places. [2024-06-04 16:38:16,276 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 235 transitions, 2786 flow [2024-06-04 16:38:16,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:16,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:16,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:16,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-04 16:38:16,277 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-04 16:38:16,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:16,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1240465668, now seen corresponding path program 14 times [2024-06-04 16:38:16,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:16,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686925305] [2024-06-04 16:38:16,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:16,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:22,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:22,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:22,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686925305] [2024-06-04 16:38:22,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686925305] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:22,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:22,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:38:22,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712257789] [2024-06-04 16:38:22,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:22,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:38:22,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:22,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:38:22,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:38:23,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:38:23,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 235 transitions, 2786 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:23,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:23,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:38:23,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:23,459 INFO L124 PetriNetUnfolderBase]: 663/1140 cut-off events. [2024-06-04 16:38:23,459 INFO L125 PetriNetUnfolderBase]: For 124289/124289 co-relation queries the response was YES. [2024-06-04 16:38:23,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9486 conditions, 1140 events. 663/1140 cut-off events. For 124289/124289 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5599 event pairs, 73 based on Foata normal form. 4/1143 useless extension candidates. Maximal degree in co-relation 9370. Up to 868 conditions per place. [2024-06-04 16:38:23,472 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 194 selfloop transitions, 61 changer transitions 0/257 dead transitions. [2024-06-04 16:38:23,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 257 transitions, 3764 flow [2024-06-04 16:38:23,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:38:23,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:38:23,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 16:38:23,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-04 16:38:23,473 INFO L175 Difference]: Start difference. First operand has 250 places, 235 transitions, 2786 flow. Second operand 10 states and 124 transitions. [2024-06-04 16:38:23,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 257 transitions, 3764 flow [2024-06-04 16:38:23,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 257 transitions, 3667 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-04 16:38:23,830 INFO L231 Difference]: Finished difference. Result has 252 places, 241 transitions, 2957 flow [2024-06-04 16:38:23,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2689, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2957, PETRI_PLACES=252, PETRI_TRANSITIONS=241} [2024-06-04 16:38:23,831 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 221 predicate places. [2024-06-04 16:38:23,831 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 241 transitions, 2957 flow [2024-06-04 16:38:23,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:23,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:23,831 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:23,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-04 16:38:23,832 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-04 16:38:23,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:23,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1251141752, now seen corresponding path program 15 times [2024-06-04 16:38:23,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:23,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522357721] [2024-06-04 16:38:23,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:23,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:31,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:31,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522357721] [2024-06-04 16:38:31,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522357721] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:31,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:31,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:38:31,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336206563] [2024-06-04 16:38:31,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:31,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:38:31,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:31,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:38:31,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:38:31,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:38:31,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 241 transitions, 2957 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:31,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:31,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:38:31,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:31,591 INFO L124 PetriNetUnfolderBase]: 669/1150 cut-off events. [2024-06-04 16:38:31,592 INFO L125 PetriNetUnfolderBase]: For 124290/124290 co-relation queries the response was YES. [2024-06-04 16:38:31,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9679 conditions, 1150 events. 669/1150 cut-off events. For 124290/124290 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5703 event pairs, 69 based on Foata normal form. 2/1151 useless extension candidates. Maximal degree in co-relation 9563. Up to 986 conditions per place. [2024-06-04 16:38:31,606 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 210 selfloop transitions, 46 changer transitions 0/258 dead transitions. [2024-06-04 16:38:31,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 258 transitions, 3717 flow [2024-06-04 16:38:31,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:38:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:38:31,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-04 16:38:31,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-04 16:38:31,607 INFO L175 Difference]: Start difference. First operand has 252 places, 241 transitions, 2957 flow. Second operand 10 states and 121 transitions. [2024-06-04 16:38:31,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 258 transitions, 3717 flow [2024-06-04 16:38:31,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 258 transitions, 3419 flow, removed 56 selfloop flow, removed 8 redundant places. [2024-06-04 16:38:31,901 INFO L231 Difference]: Finished difference. Result has 254 places, 243 transitions, 2816 flow [2024-06-04 16:38:31,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2665, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2816, PETRI_PLACES=254, PETRI_TRANSITIONS=243} [2024-06-04 16:38:31,902 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 223 predicate places. [2024-06-04 16:38:31,902 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 243 transitions, 2816 flow [2024-06-04 16:38:31,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:31,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:31,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:31,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-04 16:38:31,903 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-04 16:38:31,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:31,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1200860752, now seen corresponding path program 9 times [2024-06-04 16:38:31,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:31,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261580957] [2024-06-04 16:38:31,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:31,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:37,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:37,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:37,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261580957] [2024-06-04 16:38:37,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261580957] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:37,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:37,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:38:37,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003053053] [2024-06-04 16:38:37,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:37,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:38:37,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:37,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:38:37,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:38:37,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:38:37,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 243 transitions, 2816 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:37,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:37,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:38:37,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:38,454 INFO L124 PetriNetUnfolderBase]: 667/1147 cut-off events. [2024-06-04 16:38:38,454 INFO L125 PetriNetUnfolderBase]: For 119770/119770 co-relation queries the response was YES. [2024-06-04 16:38:38,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9302 conditions, 1147 events. 667/1147 cut-off events. For 119770/119770 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5655 event pairs, 82 based on Foata normal form. 1/1147 useless extension candidates. Maximal degree in co-relation 9186. Up to 1049 conditions per place. [2024-06-04 16:38:38,465 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 216 selfloop transitions, 36 changer transitions 0/254 dead transitions. [2024-06-04 16:38:38,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 254 transitions, 3348 flow [2024-06-04 16:38:38,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:38:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:38:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 16:38:38,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-04 16:38:38,467 INFO L175 Difference]: Start difference. First operand has 254 places, 243 transitions, 2816 flow. Second operand 10 states and 125 transitions. [2024-06-04 16:38:38,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 254 transitions, 3348 flow [2024-06-04 16:38:38,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 254 transitions, 3103 flow, removed 32 selfloop flow, removed 10 redundant places. [2024-06-04 16:38:38,769 INFO L231 Difference]: Finished difference. Result has 254 places, 243 transitions, 2648 flow [2024-06-04 16:38:38,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2571, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2648, PETRI_PLACES=254, PETRI_TRANSITIONS=243} [2024-06-04 16:38:38,769 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 223 predicate places. [2024-06-04 16:38:38,769 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 243 transitions, 2648 flow [2024-06-04 16:38:38,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:38,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:38,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:38,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-04 16:38:38,770 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-04 16:38:38,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1251148262, now seen corresponding path program 16 times [2024-06-04 16:38:38,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:38,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416304185] [2024-06-04 16:38:38,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:38,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:45,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:45,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416304185] [2024-06-04 16:38:45,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416304185] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:45,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:45,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:38:45,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145563831] [2024-06-04 16:38:45,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:45,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:38:45,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:45,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:38:45,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:38:45,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:38:45,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 243 transitions, 2648 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:45,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:45,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:38:45,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:46,258 INFO L124 PetriNetUnfolderBase]: 673/1157 cut-off events. [2024-06-04 16:38:46,258 INFO L125 PetriNetUnfolderBase]: For 124497/124497 co-relation queries the response was YES. [2024-06-04 16:38:46,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9105 conditions, 1157 events. 673/1157 cut-off events. For 124497/124497 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5703 event pairs, 72 based on Foata normal form. 2/1158 useless extension candidates. Maximal degree in co-relation 8991. Up to 877 conditions per place. [2024-06-04 16:38:46,269 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 196 selfloop transitions, 64 changer transitions 0/262 dead transitions. [2024-06-04 16:38:46,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 262 transitions, 3696 flow [2024-06-04 16:38:46,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:38:46,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:38:46,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-04 16:38:46,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-04 16:38:46,271 INFO L175 Difference]: Start difference. First operand has 254 places, 243 transitions, 2648 flow. Second operand 10 states and 126 transitions. [2024-06-04 16:38:46,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 262 transitions, 3696 flow [2024-06-04 16:38:46,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 262 transitions, 3529 flow, removed 21 selfloop flow, removed 11 redundant places. [2024-06-04 16:38:46,618 INFO L231 Difference]: Finished difference. Result has 253 places, 245 transitions, 2646 flow [2024-06-04 16:38:46,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2481, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2646, PETRI_PLACES=253, PETRI_TRANSITIONS=245} [2024-06-04 16:38:46,619 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 222 predicate places. [2024-06-04 16:38:46,619 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 245 transitions, 2646 flow [2024-06-04 16:38:46,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:46,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:46,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:46,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-04 16:38:46,620 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-04 16:38:46,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:46,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1967309447, now seen corresponding path program 1 times [2024-06-04 16:38:46,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:46,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293291536] [2024-06-04 16:38:46,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:46,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:53,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:53,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293291536] [2024-06-04 16:38:53,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293291536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:53,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:53,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:38:53,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320339679] [2024-06-04 16:38:53,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:53,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:38:53,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:53,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:38:53,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:38:53,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:38:53,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 245 transitions, 2646 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:53,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:53,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:38:53,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:54,169 INFO L124 PetriNetUnfolderBase]: 684/1178 cut-off events. [2024-06-04 16:38:54,170 INFO L125 PetriNetUnfolderBase]: For 135040/135040 co-relation queries the response was YES. [2024-06-04 16:38:54,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9336 conditions, 1178 events. 684/1178 cut-off events. For 135040/135040 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5841 event pairs, 75 based on Foata normal form. 2/1179 useless extension candidates. Maximal degree in co-relation 9223. Up to 1053 conditions per place. [2024-06-04 16:38:54,180 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 245 selfloop transitions, 27 changer transitions 0/274 dead transitions. [2024-06-04 16:38:54,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 274 transitions, 3434 flow [2024-06-04 16:38:54,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:38:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:38:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-04 16:38:54,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-04 16:38:54,182 INFO L175 Difference]: Start difference. First operand has 253 places, 245 transitions, 2646 flow. Second operand 12 states and 141 transitions. [2024-06-04 16:38:54,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 274 transitions, 3434 flow [2024-06-04 16:38:54,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 274 transitions, 3250 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-04 16:38:54,461 INFO L231 Difference]: Finished difference. Result has 255 places, 247 transitions, 2542 flow [2024-06-04 16:38:54,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2462, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2542, PETRI_PLACES=255, PETRI_TRANSITIONS=247} [2024-06-04 16:38:54,462 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 224 predicate places. [2024-06-04 16:38:54,462 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 247 transitions, 2542 flow [2024-06-04 16:38:54,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:38:54,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:54,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:54,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-04 16:38:54,462 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-04 16:38:54,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:54,463 INFO L85 PathProgramCache]: Analyzing trace with hash -659010083, now seen corresponding path program 2 times [2024-06-04 16:38:54,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:54,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735322255] [2024-06-04 16:38:54,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:54,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:01,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:01,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:01,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735322255] [2024-06-04 16:39:01,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735322255] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:01,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:01,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:39:01,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159875944] [2024-06-04 16:39:01,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:01,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:39:01,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:01,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:39:01,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:39:01,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:39:01,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 247 transitions, 2542 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:01,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:01,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:39:01,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:02,253 INFO L124 PetriNetUnfolderBase]: 688/1186 cut-off events. [2024-06-04 16:39:02,253 INFO L125 PetriNetUnfolderBase]: For 137874/137874 co-relation queries the response was YES. [2024-06-04 16:39:02,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9131 conditions, 1186 events. 688/1186 cut-off events. For 137874/137874 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5924 event pairs, 93 based on Foata normal form. 2/1187 useless extension candidates. Maximal degree in co-relation 9020. Up to 1114 conditions per place. [2024-06-04 16:39:02,265 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 244 selfloop transitions, 26 changer transitions 0/272 dead transitions. [2024-06-04 16:39:02,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 272 transitions, 3160 flow [2024-06-04 16:39:02,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:39:02,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:39:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 139 transitions. [2024-06-04 16:39:02,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3619791666666667 [2024-06-04 16:39:02,266 INFO L175 Difference]: Start difference. First operand has 255 places, 247 transitions, 2542 flow. Second operand 12 states and 139 transitions. [2024-06-04 16:39:02,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 272 transitions, 3160 flow [2024-06-04 16:39:02,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 272 transitions, 3110 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 16:39:02,564 INFO L231 Difference]: Finished difference. Result has 259 places, 248 transitions, 2562 flow [2024-06-04 16:39:02,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2496, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2562, PETRI_PLACES=259, PETRI_TRANSITIONS=248} [2024-06-04 16:39:02,564 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 228 predicate places. [2024-06-04 16:39:02,564 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 248 transitions, 2562 flow [2024-06-04 16:39:02,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:02,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:02,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:02,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-04 16:39:02,577 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-04 16:39:02,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:02,588 INFO L85 PathProgramCache]: Analyzing trace with hash -659013803, now seen corresponding path program 3 times [2024-06-04 16:39:02,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:02,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539173775] [2024-06-04 16:39:02,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:02,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:09,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:09,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539173775] [2024-06-04 16:39:09,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539173775] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:09,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:09,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:39:09,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610116542] [2024-06-04 16:39:09,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:09,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:39:09,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:09,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:39:09,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:39:09,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:39:09,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 248 transitions, 2562 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:09,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:09,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:39:09,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:09,826 INFO L124 PetriNetUnfolderBase]: 692/1194 cut-off events. [2024-06-04 16:39:09,827 INFO L125 PetriNetUnfolderBase]: For 141684/141684 co-relation queries the response was YES. [2024-06-04 16:39:09,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9216 conditions, 1194 events. 692/1194 cut-off events. For 141684/141684 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5964 event pairs, 91 based on Foata normal form. 2/1195 useless extension candidates. Maximal degree in co-relation 9103. Up to 1095 conditions per place. [2024-06-04 16:39:09,838 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 243 selfloop transitions, 25 changer transitions 0/270 dead transitions. [2024-06-04 16:39:09,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 270 transitions, 3320 flow [2024-06-04 16:39:09,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:39:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:39:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-04 16:39:09,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 16:39:09,840 INFO L175 Difference]: Start difference. First operand has 259 places, 248 transitions, 2562 flow. Second operand 10 states and 120 transitions. [2024-06-04 16:39:09,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 270 transitions, 3320 flow [2024-06-04 16:39:10,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 270 transitions, 3266 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-04 16:39:10,140 INFO L231 Difference]: Finished difference. Result has 259 places, 249 transitions, 2572 flow [2024-06-04 16:39:10,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2508, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2572, PETRI_PLACES=259, PETRI_TRANSITIONS=249} [2024-06-04 16:39:10,141 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 228 predicate places. [2024-06-04 16:39:10,141 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 249 transitions, 2572 flow [2024-06-04 16:39:10,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:10,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:10,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:10,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-04 16:39:10,142 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-04 16:39:10,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:10,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1969187272, now seen corresponding path program 1 times [2024-06-04 16:39:10,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:10,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091345276] [2024-06-04 16:39:10,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:10,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:15,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:15,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:15,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091345276] [2024-06-04 16:39:15,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091345276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:15,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:15,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:39:15,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372775067] [2024-06-04 16:39:15,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:15,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:39:15,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:15,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:39:15,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:39:15,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:39:15,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 249 transitions, 2572 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:15,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:15,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:39:15,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:16,342 INFO L124 PetriNetUnfolderBase]: 698/1204 cut-off events. [2024-06-04 16:39:16,342 INFO L125 PetriNetUnfolderBase]: For 145495/145495 co-relation queries the response was YES. [2024-06-04 16:39:16,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9314 conditions, 1204 events. 698/1204 cut-off events. For 145495/145495 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6050 event pairs, 92 based on Foata normal form. 2/1205 useless extension candidates. Maximal degree in co-relation 9200. Up to 1111 conditions per place. [2024-06-04 16:39:16,355 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 248 selfloop transitions, 28 changer transitions 0/278 dead transitions. [2024-06-04 16:39:16,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 278 transitions, 3388 flow [2024-06-04 16:39:16,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:39:16,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:39:16,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 157 transitions. [2024-06-04 16:39:16,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4088541666666667 [2024-06-04 16:39:16,356 INFO L175 Difference]: Start difference. First operand has 259 places, 249 transitions, 2572 flow. Second operand 12 states and 157 transitions. [2024-06-04 16:39:16,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 278 transitions, 3388 flow [2024-06-04 16:39:16,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 278 transitions, 3332 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-04 16:39:16,670 INFO L231 Difference]: Finished difference. Result has 263 places, 251 transitions, 2605 flow [2024-06-04 16:39:16,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2516, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2605, PETRI_PLACES=263, PETRI_TRANSITIONS=251} [2024-06-04 16:39:16,670 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 232 predicate places. [2024-06-04 16:39:16,671 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 251 transitions, 2605 flow [2024-06-04 16:39:16,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:16,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:16,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:16,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-04 16:39:16,671 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-04 16:39:16,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:16,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2056023232, now seen corresponding path program 2 times [2024-06-04 16:39:16,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:16,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584821585] [2024-06-04 16:39:16,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:16,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:23,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:23,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584821585] [2024-06-04 16:39:23,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584821585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:23,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:23,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:39:23,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851431922] [2024-06-04 16:39:23,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:23,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:39:23,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:23,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:39:23,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:39:24,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:39:24,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 251 transitions, 2605 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:24,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:24,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:39:24,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:24,653 INFO L124 PetriNetUnfolderBase]: 714/1230 cut-off events. [2024-06-04 16:39:24,654 INFO L125 PetriNetUnfolderBase]: For 155654/155654 co-relation queries the response was YES. [2024-06-04 16:39:24,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9667 conditions, 1230 events. 714/1230 cut-off events. For 155654/155654 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6189 event pairs, 92 based on Foata normal form. 2/1231 useless extension candidates. Maximal degree in co-relation 9552. Up to 1162 conditions per place. [2024-06-04 16:39:24,666 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 254 selfloop transitions, 22 changer transitions 0/278 dead transitions. [2024-06-04 16:39:24,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 278 transitions, 3447 flow [2024-06-04 16:39:24,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:39:24,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:39:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-04 16:39:24,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3693181818181818 [2024-06-04 16:39:24,667 INFO L175 Difference]: Start difference. First operand has 263 places, 251 transitions, 2605 flow. Second operand 11 states and 130 transitions. [2024-06-04 16:39:24,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 278 transitions, 3447 flow [2024-06-04 16:39:24,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 278 transitions, 3365 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-04 16:39:25,001 INFO L231 Difference]: Finished difference. Result has 265 places, 255 transitions, 2640 flow [2024-06-04 16:39:25,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2539, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2640, PETRI_PLACES=265, PETRI_TRANSITIONS=255} [2024-06-04 16:39:25,001 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 234 predicate places. [2024-06-04 16:39:25,001 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 255 transitions, 2640 flow [2024-06-04 16:39:25,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:25,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:25,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:25,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-04 16:39:25,003 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-04 16:39:25,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:25,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2055878927, now seen corresponding path program 4 times [2024-06-04 16:39:25,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:25,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075916030] [2024-06-04 16:39:25,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:25,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:31,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:31,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075916030] [2024-06-04 16:39:31,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075916030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:31,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:31,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:39:31,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110840064] [2024-06-04 16:39:31,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:31,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:39:31,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:31,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:39:31,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:39:31,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:39:31,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 255 transitions, 2640 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:31,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:31,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:39:31,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:32,128 INFO L124 PetriNetUnfolderBase]: 718/1238 cut-off events. [2024-06-04 16:39:32,129 INFO L125 PetriNetUnfolderBase]: For 159617/159617 co-relation queries the response was YES. [2024-06-04 16:39:32,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9698 conditions, 1238 events. 718/1238 cut-off events. For 159617/159617 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6257 event pairs, 95 based on Foata normal form. 2/1239 useless extension candidates. Maximal degree in co-relation 9582. Up to 1181 conditions per place. [2024-06-04 16:39:32,141 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 253 selfloop transitions, 21 changer transitions 0/276 dead transitions. [2024-06-04 16:39:32,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 276 transitions, 3252 flow [2024-06-04 16:39:32,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:39:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:39:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-04 16:39:32,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35795454545454547 [2024-06-04 16:39:32,143 INFO L175 Difference]: Start difference. First operand has 265 places, 255 transitions, 2640 flow. Second operand 11 states and 126 transitions. [2024-06-04 16:39:32,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 276 transitions, 3252 flow [2024-06-04 16:39:32,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 276 transitions, 3217 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-04 16:39:32,533 INFO L231 Difference]: Finished difference. Result has 269 places, 256 transitions, 2663 flow [2024-06-04 16:39:32,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2605, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2663, PETRI_PLACES=269, PETRI_TRANSITIONS=256} [2024-06-04 16:39:32,534 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 238 predicate places. [2024-06-04 16:39:32,534 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 256 transitions, 2663 flow [2024-06-04 16:39:32,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:32,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:32,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:32,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-04 16:39:32,535 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-04 16:39:32,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:32,535 INFO L85 PathProgramCache]: Analyzing trace with hash -256941880, now seen corresponding path program 3 times [2024-06-04 16:39:32,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:32,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787103335] [2024-06-04 16:39:32,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:32,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:40,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-04 16:39:40,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:40,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787103335] [2024-06-04 16:39:40,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787103335] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:40,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:40,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:39:40,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596556093] [2024-06-04 16:39:40,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:40,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:39:40,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:40,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:39:40,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:39:40,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:39:40,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 256 transitions, 2663 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:40,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:40,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:39:40,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:40,861 INFO L124 PetriNetUnfolderBase]: 714/1232 cut-off events. [2024-06-04 16:39:40,861 INFO L125 PetriNetUnfolderBase]: For 156697/156697 co-relation queries the response was YES. [2024-06-04 16:39:40,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9577 conditions, 1232 events. 714/1232 cut-off events. For 156697/156697 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6234 event pairs, 92 based on Foata normal form. 2/1233 useless extension candidates. Maximal degree in co-relation 9459. Up to 1176 conditions per place. [2024-06-04 16:39:40,873 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 256 selfloop transitions, 19 changer transitions 0/277 dead transitions. [2024-06-04 16:39:40,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 277 transitions, 3273 flow [2024-06-04 16:39:40,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:39:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:39:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-04 16:39:40,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35795454545454547 [2024-06-04 16:39:40,876 INFO L175 Difference]: Start difference. First operand has 269 places, 256 transitions, 2663 flow. Second operand 11 states and 126 transitions. [2024-06-04 16:39:40,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 277 transitions, 3273 flow [2024-06-04 16:39:41,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 277 transitions, 3207 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-04 16:39:41,272 INFO L231 Difference]: Finished difference. Result has 270 places, 256 transitions, 2640 flow [2024-06-04 16:39:41,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2597, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2640, PETRI_PLACES=270, PETRI_TRANSITIONS=256} [2024-06-04 16:39:41,273 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 239 predicate places. [2024-06-04 16:39:41,273 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 256 transitions, 2640 flow [2024-06-04 16:39:41,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:41,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:41,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:41,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-04 16:39:41,273 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-04 16:39:41,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:41,274 INFO L85 PathProgramCache]: Analyzing trace with hash -572174123, now seen corresponding path program 5 times [2024-06-04 16:39:41,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:41,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20430579] [2024-06-04 16:39:41,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:41,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:47,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-04 16:39:47,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:47,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20430579] [2024-06-04 16:39:47,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20430579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:47,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:47,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:39:47,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756978647] [2024-06-04 16:39:47,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:47,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:39:47,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:47,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:39:47,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:39:48,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:39:48,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 256 transitions, 2640 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:48,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:48,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:39:48,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:48,692 INFO L124 PetriNetUnfolderBase]: 711/1227 cut-off events. [2024-06-04 16:39:48,692 INFO L125 PetriNetUnfolderBase]: For 153589/153589 co-relation queries the response was YES. [2024-06-04 16:39:48,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9405 conditions, 1227 events. 711/1227 cut-off events. For 153589/153589 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6211 event pairs, 93 based on Foata normal form. 2/1228 useless extension candidates. Maximal degree in co-relation 9287. Up to 1176 conditions per place. [2024-06-04 16:39:48,702 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 256 selfloop transitions, 18 changer transitions 0/276 dead transitions. [2024-06-04 16:39:48,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 276 transitions, 3242 flow [2024-06-04 16:39:48,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:39:48,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:39:48,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-04 16:39:48,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-04 16:39:48,704 INFO L175 Difference]: Start difference. First operand has 270 places, 256 transitions, 2640 flow. Second operand 11 states and 124 transitions. [2024-06-04 16:39:48,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 276 transitions, 3242 flow [2024-06-04 16:39:49,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 276 transitions, 3195 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 16:39:49,104 INFO L231 Difference]: Finished difference. Result has 271 places, 256 transitions, 2633 flow [2024-06-04 16:39:49,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2593, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2633, PETRI_PLACES=271, PETRI_TRANSITIONS=256} [2024-06-04 16:39:49,104 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 240 predicate places. [2024-06-04 16:39:49,104 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 256 transitions, 2633 flow [2024-06-04 16:39:49,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:49,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:49,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:49,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-04 16:39:49,105 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-04 16:39:49,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:49,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2055879082, now seen corresponding path program 4 times [2024-06-04 16:39:49,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:49,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247154366] [2024-06-04 16:39:49,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:49,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:55,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:55,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247154366] [2024-06-04 16:39:55,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247154366] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:55,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:55,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:39:55,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129945336] [2024-06-04 16:39:55,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:55,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:39:55,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:55,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:39:55,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:39:55,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:39:55,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 256 transitions, 2633 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:55,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:55,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:39:55,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:56,584 INFO L124 PetriNetUnfolderBase]: 707/1221 cut-off events. [2024-06-04 16:39:56,584 INFO L125 PetriNetUnfolderBase]: For 150108/150108 co-relation queries the response was YES. [2024-06-04 16:39:56,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9238 conditions, 1221 events. 707/1221 cut-off events. For 150108/150108 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6163 event pairs, 90 based on Foata normal form. 2/1222 useless extension candidates. Maximal degree in co-relation 9119. Up to 1144 conditions per place. [2024-06-04 16:39:56,596 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 250 selfloop transitions, 26 changer transitions 0/278 dead transitions. [2024-06-04 16:39:56,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 278 transitions, 3249 flow [2024-06-04 16:39:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:39:56,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:39:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-04 16:39:56,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-04 16:39:56,597 INFO L175 Difference]: Start difference. First operand has 271 places, 256 transitions, 2633 flow. Second operand 11 states and 131 transitions. [2024-06-04 16:39:56,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 278 transitions, 3249 flow [2024-06-04 16:39:56,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 278 transitions, 3192 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-04 16:39:56,994 INFO L231 Difference]: Finished difference. Result has 272 places, 256 transitions, 2633 flow [2024-06-04 16:39:56,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2576, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2633, PETRI_PLACES=272, PETRI_TRANSITIONS=256} [2024-06-04 16:39:56,995 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 241 predicate places. [2024-06-04 16:39:56,995 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 256 transitions, 2633 flow [2024-06-04 16:39:56,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:39:56,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:56,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:56,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-04 16:39:56,996 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-04 16:39:56,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:56,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1287537288, now seen corresponding path program 1 times [2024-06-04 16:39:56,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:56,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282567576] [2024-06-04 16:39:56,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:56,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:05,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-04 16:40:05,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:05,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282567576] [2024-06-04 16:40:05,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282567576] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:05,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:05,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:40:05,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059160216] [2024-06-04 16:40:05,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:05,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:40:05,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:05,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:40:05,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:40:06,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:40:06,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 256 transitions, 2633 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:06,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:06,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:40:06,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:06,545 INFO L124 PetriNetUnfolderBase]: 711/1229 cut-off events. [2024-06-04 16:40:06,545 INFO L125 PetriNetUnfolderBase]: For 153659/153659 co-relation queries the response was YES. [2024-06-04 16:40:06,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9301 conditions, 1229 events. 711/1229 cut-off events. For 153659/153659 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6239 event pairs, 64 based on Foata normal form. 2/1230 useless extension candidates. Maximal degree in co-relation 9181. Up to 1070 conditions per place. [2024-06-04 16:40:06,557 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 226 selfloop transitions, 48 changer transitions 0/276 dead transitions. [2024-06-04 16:40:06,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 276 transitions, 3241 flow [2024-06-04 16:40:06,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:40:06,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:40:06,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-04 16:40:06,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-04 16:40:06,559 INFO L175 Difference]: Start difference. First operand has 272 places, 256 transitions, 2633 flow. Second operand 10 states and 133 transitions. [2024-06-04 16:40:06,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 276 transitions, 3241 flow [2024-06-04 16:40:06,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 276 transitions, 3111 flow, removed 3 selfloop flow, removed 13 redundant places. [2024-06-04 16:40:06,935 INFO L231 Difference]: Finished difference. Result has 269 places, 257 transitions, 2611 flow [2024-06-04 16:40:06,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2503, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2611, PETRI_PLACES=269, PETRI_TRANSITIONS=257} [2024-06-04 16:40:06,935 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 238 predicate places. [2024-06-04 16:40:06,935 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 257 transitions, 2611 flow [2024-06-04 16:40:06,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:06,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:06,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:06,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-04 16:40:06,936 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-04 16:40:06,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:06,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1340651976, now seen corresponding path program 5 times [2024-06-04 16:40:06,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:06,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325792710] [2024-06-04 16:40:06,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:06,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:16,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:16,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325792710] [2024-06-04 16:40:16,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325792710] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:16,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:16,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:40:16,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580408317] [2024-06-04 16:40:16,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:16,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:40:16,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:16,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:40:16,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:40:16,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:40:16,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 257 transitions, 2611 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:16,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:16,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:40:16,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:17,665 INFO L124 PetriNetUnfolderBase]: 717/1239 cut-off events. [2024-06-04 16:40:17,665 INFO L125 PetriNetUnfolderBase]: For 156985/156985 co-relation queries the response was YES. [2024-06-04 16:40:17,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9396 conditions, 1239 events. 717/1239 cut-off events. For 156985/156985 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6265 event pairs, 68 based on Foata normal form. 2/1240 useless extension candidates. Maximal degree in co-relation 9276. Up to 598 conditions per place. [2024-06-04 16:40:17,678 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 145 selfloop transitions, 136 changer transitions 0/283 dead transitions. [2024-06-04 16:40:17,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 283 transitions, 3609 flow [2024-06-04 16:40:17,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:40:17,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:40:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-04 16:40:17,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4147727272727273 [2024-06-04 16:40:17,680 INFO L175 Difference]: Start difference. First operand has 269 places, 257 transitions, 2611 flow. Second operand 11 states and 146 transitions. [2024-06-04 16:40:17,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 283 transitions, 3609 flow [2024-06-04 16:40:18,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 283 transitions, 3511 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-04 16:40:18,081 INFO L231 Difference]: Finished difference. Result has 272 places, 259 transitions, 2812 flow [2024-06-04 16:40:18,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2513, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2812, PETRI_PLACES=272, PETRI_TRANSITIONS=259} [2024-06-04 16:40:18,082 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 241 predicate places. [2024-06-04 16:40:18,082 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 259 transitions, 2812 flow [2024-06-04 16:40:18,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:18,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:18,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:18,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-04 16:40:18,083 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-04 16:40:18,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:18,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1293263019, now seen corresponding path program 6 times [2024-06-04 16:40:18,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:18,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191085066] [2024-06-04 16:40:18,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:18,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:25,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:25,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191085066] [2024-06-04 16:40:25,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191085066] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:25,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:25,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:40:25,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803047831] [2024-06-04 16:40:25,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:25,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:40:25,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:25,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:40:25,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:40:26,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:40:26,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 259 transitions, 2812 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:26,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:26,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:40:26,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:26,772 INFO L124 PetriNetUnfolderBase]: 728/1260 cut-off events. [2024-06-04 16:40:26,772 INFO L125 PetriNetUnfolderBase]: For 169106/169106 co-relation queries the response was YES. [2024-06-04 16:40:26,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9955 conditions, 1260 events. 728/1260 cut-off events. For 169106/169106 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 6434 event pairs, 79 based on Foata normal form. 2/1261 useless extension candidates. Maximal degree in co-relation 9834. Up to 1032 conditions per place. [2024-06-04 16:40:26,784 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 213 selfloop transitions, 67 changer transitions 0/282 dead transitions. [2024-06-04 16:40:26,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 282 transitions, 3626 flow [2024-06-04 16:40:26,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:40:26,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:40:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-04 16:40:26,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-04 16:40:26,787 INFO L175 Difference]: Start difference. First operand has 272 places, 259 transitions, 2812 flow. Second operand 11 states and 138 transitions. [2024-06-04 16:40:26,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 282 transitions, 3626 flow [2024-06-04 16:40:27,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 282 transitions, 3372 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-04 16:40:27,168 INFO L231 Difference]: Finished difference. Result has 275 places, 261 transitions, 2722 flow [2024-06-04 16:40:27,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2558, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2722, PETRI_PLACES=275, PETRI_TRANSITIONS=261} [2024-06-04 16:40:27,169 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 244 predicate places. [2024-06-04 16:40:27,169 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 261 transitions, 2722 flow [2024-06-04 16:40:27,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:27,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:27,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:27,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-04 16:40:27,170 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-04 16:40:27,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:27,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1293109414, now seen corresponding path program 6 times [2024-06-04 16:40:27,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:27,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290773644] [2024-06-04 16:40:27,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:27,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:35,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:35,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290773644] [2024-06-04 16:40:35,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290773644] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:35,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:35,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:40:35,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125802325] [2024-06-04 16:40:35,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:35,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:40:35,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:35,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:40:35,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:40:35,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:40:35,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 261 transitions, 2722 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:35,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:35,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:40:35,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:36,481 INFO L124 PetriNetUnfolderBase]: 724/1254 cut-off events. [2024-06-04 16:40:36,481 INFO L125 PetriNetUnfolderBase]: For 165595/165595 co-relation queries the response was YES. [2024-06-04 16:40:36,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9597 conditions, 1254 events. 724/1254 cut-off events. For 165595/165595 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 6464 event pairs, 56 based on Foata normal form. 2/1255 useless extension candidates. Maximal degree in co-relation 9475. Up to 910 conditions per place. [2024-06-04 16:40:36,494 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 195 selfloop transitions, 87 changer transitions 0/284 dead transitions. [2024-06-04 16:40:36,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 284 transitions, 3361 flow [2024-06-04 16:40:36,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:40:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:40:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-06-04 16:40:36,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4005681818181818 [2024-06-04 16:40:36,495 INFO L175 Difference]: Start difference. First operand has 275 places, 261 transitions, 2722 flow. Second operand 11 states and 141 transitions. [2024-06-04 16:40:36,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 284 transitions, 3361 flow [2024-06-04 16:40:36,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 284 transitions, 3238 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-04 16:40:36,908 INFO L231 Difference]: Finished difference. Result has 280 places, 262 transitions, 2787 flow [2024-06-04 16:40:36,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2602, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2787, PETRI_PLACES=280, PETRI_TRANSITIONS=262} [2024-06-04 16:40:36,908 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 249 predicate places. [2024-06-04 16:40:36,909 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 262 transitions, 2787 flow [2024-06-04 16:40:36,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:36,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:36,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:36,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-04 16:40:36,909 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-04 16:40:36,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:36,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1293259299, now seen corresponding path program 7 times [2024-06-04 16:40:36,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:36,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069083597] [2024-06-04 16:40:36,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:36,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:42,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:42,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069083597] [2024-06-04 16:40:42,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069083597] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:42,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:42,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:40:42,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308396329] [2024-06-04 16:40:42,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:42,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:40:42,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:42,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:40:42,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:40:43,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:40:43,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 262 transitions, 2787 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:43,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:43,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:40:43,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:43,674 INFO L124 PetriNetUnfolderBase]: 731/1267 cut-off events. [2024-06-04 16:40:43,675 INFO L125 PetriNetUnfolderBase]: For 168425/168425 co-relation queries the response was YES. [2024-06-04 16:40:43,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9807 conditions, 1267 events. 731/1267 cut-off events. For 168425/168425 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 6517 event pairs, 80 based on Foata normal form. 2/1268 useless extension candidates. Maximal degree in co-relation 9684. Up to 1057 conditions per place. [2024-06-04 16:40:43,688 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 213 selfloop transitions, 69 changer transitions 0/284 dead transitions. [2024-06-04 16:40:43,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 284 transitions, 3432 flow [2024-06-04 16:40:43,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:40:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:40:43,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-04 16:40:43,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-04 16:40:43,690 INFO L175 Difference]: Start difference. First operand has 280 places, 262 transitions, 2787 flow. Second operand 11 states and 136 transitions. [2024-06-04 16:40:43,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 284 transitions, 3432 flow [2024-06-04 16:40:44,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 284 transitions, 3265 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-04 16:40:44,158 INFO L231 Difference]: Finished difference. Result has 284 places, 265 transitions, 2793 flow [2024-06-04 16:40:44,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2622, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2793, PETRI_PLACES=284, PETRI_TRANSITIONS=265} [2024-06-04 16:40:44,158 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 253 predicate places. [2024-06-04 16:40:44,158 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 265 transitions, 2793 flow [2024-06-04 16:40:44,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:44,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:44,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:44,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-04 16:40:44,159 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-04 16:40:44,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:44,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1340444431, now seen corresponding path program 8 times [2024-06-04 16:40:44,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:44,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384710586] [2024-06-04 16:40:44,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:44,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:50,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:50,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384710586] [2024-06-04 16:40:50,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384710586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:50,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:50,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:40:50,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929167492] [2024-06-04 16:40:50,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:50,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:40:50,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:50,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:40:50,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:40:51,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:40:51,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 265 transitions, 2793 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:51,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:51,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:40:51,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:51,631 INFO L124 PetriNetUnfolderBase]: 735/1275 cut-off events. [2024-06-04 16:40:51,632 INFO L125 PetriNetUnfolderBase]: For 172149/172149 co-relation queries the response was YES. [2024-06-04 16:40:51,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9824 conditions, 1275 events. 735/1275 cut-off events. For 172149/172149 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6570 event pairs, 82 based on Foata normal form. 2/1276 useless extension candidates. Maximal degree in co-relation 9700. Up to 1041 conditions per place. [2024-06-04 16:40:51,644 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 211 selfloop transitions, 74 changer transitions 0/287 dead transitions. [2024-06-04 16:40:51,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 287 transitions, 3449 flow [2024-06-04 16:40:51,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:40:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:40:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-04 16:40:51,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-04 16:40:51,646 INFO L175 Difference]: Start difference. First operand has 284 places, 265 transitions, 2793 flow. Second operand 11 states and 136 transitions. [2024-06-04 16:40:51,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 287 transitions, 3449 flow [2024-06-04 16:40:52,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 287 transitions, 3311 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-04 16:40:52,113 INFO L231 Difference]: Finished difference. Result has 288 places, 268 transitions, 2891 flow [2024-06-04 16:40:52,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2655, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2891, PETRI_PLACES=288, PETRI_TRANSITIONS=268} [2024-06-04 16:40:52,123 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 257 predicate places. [2024-06-04 16:40:52,123 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 268 transitions, 2891 flow [2024-06-04 16:40:52,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:52,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:52,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:52,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-04 16:40:52,124 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-04 16:40:52,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:52,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1335082051, now seen corresponding path program 9 times [2024-06-04 16:40:52,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:52,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907919960] [2024-06-04 16:40:52,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:52,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:58,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:58,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907919960] [2024-06-04 16:40:58,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907919960] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:58,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:58,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:40:58,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224413456] [2024-06-04 16:40:58,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:58,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:40:58,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:58,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:40:58,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:40:58,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:40:58,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 268 transitions, 2891 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:58,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:58,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:40:58,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:58,991 INFO L124 PetriNetUnfolderBase]: 732/1270 cut-off events. [2024-06-04 16:40:58,991 INFO L125 PetriNetUnfolderBase]: For 168029/168029 co-relation queries the response was YES. [2024-06-04 16:40:58,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9775 conditions, 1270 events. 732/1270 cut-off events. For 168029/168029 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6545 event pairs, 79 based on Foata normal form. 2/1271 useless extension candidates. Maximal degree in co-relation 9649. Up to 933 conditions per place. [2024-06-04 16:40:59,001 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 187 selfloop transitions, 97 changer transitions 0/286 dead transitions. [2024-06-04 16:40:59,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 286 transitions, 3509 flow [2024-06-04 16:40:59,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:40:59,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:40:59,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-04 16:40:59,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-04 16:40:59,003 INFO L175 Difference]: Start difference. First operand has 288 places, 268 transitions, 2891 flow. Second operand 10 states and 132 transitions. [2024-06-04 16:40:59,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 286 transitions, 3509 flow [2024-06-04 16:40:59,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 286 transitions, 3376 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-04 16:40:59,412 INFO L231 Difference]: Finished difference. Result has 289 places, 268 transitions, 2958 flow [2024-06-04 16:40:59,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2758, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2958, PETRI_PLACES=289, PETRI_TRANSITIONS=268} [2024-06-04 16:40:59,412 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 258 predicate places. [2024-06-04 16:40:59,413 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 268 transitions, 2958 flow [2024-06-04 16:40:59,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:40:59,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:59,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:59,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-04 16:40:59,413 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-04 16:40:59,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:59,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1287747034, now seen corresponding path program 7 times [2024-06-04 16:40:59,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:59,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919087637] [2024-06-04 16:40:59,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:59,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:06,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:06,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919087637] [2024-06-04 16:41:06,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919087637] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:06,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:06,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:41:06,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083683551] [2024-06-04 16:41:06,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:06,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:41:06,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:06,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:41:06,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:41:06,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:41:06,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 268 transitions, 2958 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:06,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:06,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:41:06,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:07,324 INFO L124 PetriNetUnfolderBase]: 728/1264 cut-off events. [2024-06-04 16:41:07,324 INFO L125 PetriNetUnfolderBase]: For 164224/164224 co-relation queries the response was YES. [2024-06-04 16:41:07,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9655 conditions, 1264 events. 728/1264 cut-off events. For 164224/164224 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6549 event pairs, 54 based on Foata normal form. 2/1265 useless extension candidates. Maximal degree in co-relation 9528. Up to 920 conditions per place. [2024-06-04 16:41:07,338 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 200 selfloop transitions, 88 changer transitions 0/290 dead transitions. [2024-06-04 16:41:07,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 290 transitions, 3600 flow [2024-06-04 16:41:07,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:41:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:41:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2024-06-04 16:41:07,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-04 16:41:07,339 INFO L175 Difference]: Start difference. First operand has 289 places, 268 transitions, 2958 flow. Second operand 11 states and 140 transitions. [2024-06-04 16:41:07,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 290 transitions, 3600 flow [2024-06-04 16:41:07,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 290 transitions, 3386 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-04 16:41:07,762 INFO L231 Difference]: Finished difference. Result has 291 places, 268 transitions, 2925 flow [2024-06-04 16:41:07,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2744, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2925, PETRI_PLACES=291, PETRI_TRANSITIONS=268} [2024-06-04 16:41:07,762 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 260 predicate places. [2024-06-04 16:41:07,762 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 268 transitions, 2925 flow [2024-06-04 16:41:07,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:07,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:07,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:07,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-04 16:41:07,763 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-04 16:41:07,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:07,763 INFO L85 PathProgramCache]: Analyzing trace with hash -253967346, now seen corresponding path program 8 times [2024-06-04 16:41:07,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:07,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159998500] [2024-06-04 16:41:07,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:07,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:14,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:14,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159998500] [2024-06-04 16:41:14,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159998500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:14,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:14,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:41:14,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925471234] [2024-06-04 16:41:14,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:14,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:41:14,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:14,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:41:14,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:41:14,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:41:14,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 268 transitions, 2925 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:14,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:14,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:41:14,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:14,977 INFO L124 PetriNetUnfolderBase]: 734/1274 cut-off events. [2024-06-04 16:41:14,978 INFO L125 PetriNetUnfolderBase]: For 163406/163406 co-relation queries the response was YES. [2024-06-04 16:41:14,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9698 conditions, 1274 events. 734/1274 cut-off events. For 163406/163406 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6573 event pairs, 81 based on Foata normal form. 2/1275 useless extension candidates. Maximal degree in co-relation 9570. Up to 1143 conditions per place. [2024-06-04 16:41:14,991 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 250 selfloop transitions, 38 changer transitions 0/290 dead transitions. [2024-06-04 16:41:14,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 290 transitions, 3769 flow [2024-06-04 16:41:14,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:41:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:41:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-04 16:41:14,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-04 16:41:14,992 INFO L175 Difference]: Start difference. First operand has 291 places, 268 transitions, 2925 flow. Second operand 11 states and 134 transitions. [2024-06-04 16:41:14,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 290 transitions, 3769 flow [2024-06-04 16:41:15,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 290 transitions, 3533 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-06-04 16:41:15,432 INFO L231 Difference]: Finished difference. Result has 290 places, 270 transitions, 2796 flow [2024-06-04 16:41:15,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2689, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2796, PETRI_PLACES=290, PETRI_TRANSITIONS=270} [2024-06-04 16:41:15,433 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 259 predicate places. [2024-06-04 16:41:15,433 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 270 transitions, 2796 flow [2024-06-04 16:41:15,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:15,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:15,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:15,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-04 16:41:15,433 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-04 16:41:15,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:15,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1411390577, now seen corresponding path program 10 times [2024-06-04 16:41:15,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:15,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681930383] [2024-06-04 16:41:15,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:15,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:22,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:22,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:22,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681930383] [2024-06-04 16:41:22,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681930383] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:22,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:22,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:41:22,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515354512] [2024-06-04 16:41:22,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:22,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:41:22,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:22,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:41:22,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:41:22,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:41:22,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 270 transitions, 2796 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:22,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:22,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:41:22,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:22,842 INFO L124 PetriNetUnfolderBase]: 758/1326 cut-off events. [2024-06-04 16:41:22,842 INFO L125 PetriNetUnfolderBase]: For 218345/218345 co-relation queries the response was YES. [2024-06-04 16:41:22,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9779 conditions, 1326 events. 758/1326 cut-off events. For 218345/218345 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6903 event pairs, 84 based on Foata normal form. 14/1339 useless extension candidates. Maximal degree in co-relation 9650. Up to 1163 conditions per place. [2024-06-04 16:41:22,856 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 249 selfloop transitions, 35 changer transitions 9/295 dead transitions. [2024-06-04 16:41:22,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 295 transitions, 3502 flow [2024-06-04 16:41:22,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:41:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:41:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-04 16:41:22,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39488636363636365 [2024-06-04 16:41:22,857 INFO L175 Difference]: Start difference. First operand has 290 places, 270 transitions, 2796 flow. Second operand 11 states and 139 transitions. [2024-06-04 16:41:22,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 295 transitions, 3502 flow [2024-06-04 16:41:23,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 295 transitions, 3401 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-04 16:41:23,358 INFO L231 Difference]: Finished difference. Result has 292 places, 269 transitions, 2759 flow [2024-06-04 16:41:23,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2695, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2759, PETRI_PLACES=292, PETRI_TRANSITIONS=269} [2024-06-04 16:41:23,359 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 261 predicate places. [2024-06-04 16:41:23,359 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 269 transitions, 2759 flow [2024-06-04 16:41:23,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:23,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:23,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:23,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-04 16:41:23,360 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-04 16:41:23,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:23,360 INFO L85 PathProgramCache]: Analyzing trace with hash -447906756, now seen corresponding path program 9 times [2024-06-04 16:41:23,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:23,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057707555] [2024-06-04 16:41:23,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:23,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:29,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:29,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:29,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057707555] [2024-06-04 16:41:29,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057707555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:29,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:29,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:41:29,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856330316] [2024-06-04 16:41:29,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:29,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:41:29,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:29,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:41:29,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:41:29,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:41:29,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 269 transitions, 2759 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:29,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:29,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:41:29,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:30,310 INFO L124 PetriNetUnfolderBase]: 742/1300 cut-off events. [2024-06-04 16:41:30,311 INFO L125 PetriNetUnfolderBase]: For 161264/161264 co-relation queries the response was YES. [2024-06-04 16:41:30,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9466 conditions, 1300 events. 742/1300 cut-off events. For 161264/161264 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6777 event pairs, 84 based on Foata normal form. 2/1301 useless extension candidates. Maximal degree in co-relation 9336. Up to 1076 conditions per place. [2024-06-04 16:41:30,324 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 236 selfloop transitions, 54 changer transitions 0/292 dead transitions. [2024-06-04 16:41:30,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 292 transitions, 3969 flow [2024-06-04 16:41:30,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:41:30,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:41:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-04 16:41:30,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-04 16:41:30,352 INFO L175 Difference]: Start difference. First operand has 292 places, 269 transitions, 2759 flow. Second operand 11 states and 144 transitions. [2024-06-04 16:41:30,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 292 transitions, 3969 flow [2024-06-04 16:41:30,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 292 transitions, 3879 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-04 16:41:30,878 INFO L231 Difference]: Finished difference. Result has 294 places, 269 transitions, 2782 flow [2024-06-04 16:41:30,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2669, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2782, PETRI_PLACES=294, PETRI_TRANSITIONS=269} [2024-06-04 16:41:30,879 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 263 predicate places. [2024-06-04 16:41:30,879 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 269 transitions, 2782 flow [2024-06-04 16:41:30,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:30,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:30,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:30,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-04 16:41:30,879 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-04 16:41:30,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:30,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1913112806, now seen corresponding path program 2 times [2024-06-04 16:41:30,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:30,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397595357] [2024-06-04 16:41:30,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:30,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:37,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:37,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397595357] [2024-06-04 16:41:37,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397595357] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:37,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:37,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:41:37,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230107037] [2024-06-04 16:41:37,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:37,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:41:37,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:37,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:41:37,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:41:38,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:41:38,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 269 transitions, 2782 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:38,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:38,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:41:38,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:38,601 INFO L124 PetriNetUnfolderBase]: 746/1308 cut-off events. [2024-06-04 16:41:38,601 INFO L125 PetriNetUnfolderBase]: For 164573/164573 co-relation queries the response was YES. [2024-06-04 16:41:38,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9556 conditions, 1308 events. 746/1308 cut-off events. For 164573/164573 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6823 event pairs, 84 based on Foata normal form. 2/1309 useless extension candidates. Maximal degree in co-relation 9425. Up to 1228 conditions per place. [2024-06-04 16:41:38,615 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 257 selfloop transitions, 27 changer transitions 1/287 dead transitions. [2024-06-04 16:41:38,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 287 transitions, 3415 flow [2024-06-04 16:41:38,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:41:38,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:41:38,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-04 16:41:38,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-04 16:41:38,617 INFO L175 Difference]: Start difference. First operand has 294 places, 269 transitions, 2782 flow. Second operand 10 states and 118 transitions. [2024-06-04 16:41:38,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 287 transitions, 3415 flow [2024-06-04 16:41:39,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 287 transitions, 3255 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-04 16:41:39,139 INFO L231 Difference]: Finished difference. Result has 294 places, 270 transitions, 2695 flow [2024-06-04 16:41:39,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2623, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2695, PETRI_PLACES=294, PETRI_TRANSITIONS=270} [2024-06-04 16:41:39,140 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 263 predicate places. [2024-06-04 16:41:39,140 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 270 transitions, 2695 flow [2024-06-04 16:41:39,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:39,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:39,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:39,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-04 16:41:39,141 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-04 16:41:39,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:39,141 INFO L85 PathProgramCache]: Analyzing trace with hash -246333410, now seen corresponding path program 3 times [2024-06-04 16:41:39,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:39,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415220771] [2024-06-04 16:41:39,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:39,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:45,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:45,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:45,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415220771] [2024-06-04 16:41:45,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415220771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:45,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:45,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:41:45,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780847553] [2024-06-04 16:41:45,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:45,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:41:45,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:45,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:41:45,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:41:45,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:41:45,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 270 transitions, 2695 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:45,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:45,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:41:45,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:46,123 INFO L124 PetriNetUnfolderBase]: 726/1268 cut-off events. [2024-06-04 16:41:46,124 INFO L125 PetriNetUnfolderBase]: For 167566/167566 co-relation queries the response was YES. [2024-06-04 16:41:46,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9308 conditions, 1268 events. 726/1268 cut-off events. For 167566/167566 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6594 event pairs, 78 based on Foata normal form. 2/1269 useless extension candidates. Maximal degree in co-relation 9175. Up to 1188 conditions per place. [2024-06-04 16:41:46,137 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 258 selfloop transitions, 27 changer transitions 0/287 dead transitions. [2024-06-04 16:41:46,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 287 transitions, 3317 flow [2024-06-04 16:41:46,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:41:46,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:41:46,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-04 16:41:46,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.365625 [2024-06-04 16:41:46,138 INFO L175 Difference]: Start difference. First operand has 294 places, 270 transitions, 2695 flow. Second operand 10 states and 117 transitions. [2024-06-04 16:41:46,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 287 transitions, 3317 flow [2024-06-04 16:41:46,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 287 transitions, 3261 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-04 16:41:46,645 INFO L231 Difference]: Finished difference. Result has 297 places, 271 transitions, 2709 flow [2024-06-04 16:41:46,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2639, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2709, PETRI_PLACES=297, PETRI_TRANSITIONS=271} [2024-06-04 16:41:46,645 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 266 predicate places. [2024-06-04 16:41:46,646 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 271 transitions, 2709 flow [2024-06-04 16:41:46,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:46,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:46,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:46,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-04 16:41:46,646 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-04 16:41:46,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:46,647 INFO L85 PathProgramCache]: Analyzing trace with hash -253961766, now seen corresponding path program 10 times [2024-06-04 16:41:46,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:46,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659358130] [2024-06-04 16:41:46,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:46,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:54,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:54,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:54,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659358130] [2024-06-04 16:41:54,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659358130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:54,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:54,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:41:54,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344899782] [2024-06-04 16:41:54,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:54,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:41:54,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:54,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:41:54,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:41:54,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:41:54,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 271 transitions, 2709 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:54,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:54,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:41:54,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:55,410 INFO L124 PetriNetUnfolderBase]: 732/1278 cut-off events. [2024-06-04 16:41:55,411 INFO L125 PetriNetUnfolderBase]: For 171065/171065 co-relation queries the response was YES. [2024-06-04 16:41:55,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9397 conditions, 1278 events. 732/1278 cut-off events. For 171065/171065 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6657 event pairs, 75 based on Foata normal form. 2/1279 useless extension candidates. Maximal degree in co-relation 9263. Up to 1150 conditions per place. [2024-06-04 16:41:55,424 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 251 selfloop transitions, 40 changer transitions 0/293 dead transitions. [2024-06-04 16:41:55,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 293 transitions, 3565 flow [2024-06-04 16:41:55,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:41:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:41:55,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-04 16:41:55,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-04 16:41:55,426 INFO L175 Difference]: Start difference. First operand has 297 places, 271 transitions, 2709 flow. Second operand 11 states and 136 transitions. [2024-06-04 16:41:55,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 293 transitions, 3565 flow [2024-06-04 16:41:55,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 293 transitions, 3505 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-04 16:41:55,945 INFO L231 Difference]: Finished difference. Result has 300 places, 273 transitions, 2756 flow [2024-06-04 16:41:55,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2649, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2756, PETRI_PLACES=300, PETRI_TRANSITIONS=273} [2024-06-04 16:41:55,946 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 269 predicate places. [2024-06-04 16:41:55,946 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 273 transitions, 2756 flow [2024-06-04 16:41:55,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:41:55,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:55,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:55,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-04 16:41:55,947 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-04 16:41:55,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:55,947 INFO L85 PathProgramCache]: Analyzing trace with hash -253752020, now seen corresponding path program 4 times [2024-06-04 16:41:55,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:55,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173795393] [2024-06-04 16:41:55,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:55,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:03,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:03,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173795393] [2024-06-04 16:42:03,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173795393] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:03,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:03,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:42:03,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62775803] [2024-06-04 16:42:03,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:03,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:42:03,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:03,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:42:03,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:42:03,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:42:03,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 273 transitions, 2756 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:03,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:03,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:42:03,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:03,872 INFO L124 PetriNetUnfolderBase]: 736/1286 cut-off events. [2024-06-04 16:42:03,872 INFO L125 PetriNetUnfolderBase]: For 174773/174773 co-relation queries the response was YES. [2024-06-04 16:42:03,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9497 conditions, 1286 events. 736/1286 cut-off events. For 174773/174773 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6713 event pairs, 79 based on Foata normal form. 2/1287 useless extension candidates. Maximal degree in co-relation 9362. Up to 1206 conditions per place. [2024-06-04 16:42:03,885 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 262 selfloop transitions, 27 changer transitions 0/291 dead transitions. [2024-06-04 16:42:03,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 291 transitions, 3394 flow [2024-06-04 16:42:03,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:42:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:42:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-04 16:42:03,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 16:42:03,889 INFO L175 Difference]: Start difference. First operand has 300 places, 273 transitions, 2756 flow. Second operand 10 states and 120 transitions. [2024-06-04 16:42:03,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 291 transitions, 3394 flow [2024-06-04 16:42:04,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 291 transitions, 3311 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-04 16:42:04,531 INFO L231 Difference]: Finished difference. Result has 302 places, 274 transitions, 2745 flow [2024-06-04 16:42:04,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2673, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2745, PETRI_PLACES=302, PETRI_TRANSITIONS=274} [2024-06-04 16:42:04,532 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 271 predicate places. [2024-06-04 16:42:04,532 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 274 transitions, 2745 flow [2024-06-04 16:42:04,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:04,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:04,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:04,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-04 16:42:04,533 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-04 16:42:04,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:04,534 INFO L85 PathProgramCache]: Analyzing trace with hash -253759956, now seen corresponding path program 11 times [2024-06-04 16:42:04,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:04,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058958061] [2024-06-04 16:42:04,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:04,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:11,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:11,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058958061] [2024-06-04 16:42:11,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058958061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:11,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:11,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:42:11,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427759726] [2024-06-04 16:42:11,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:11,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:42:11,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:11,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:42:11,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:42:11,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:42:11,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 274 transitions, 2745 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:11,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:11,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:42:11,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:12,645 INFO L124 PetriNetUnfolderBase]: 732/1280 cut-off events. [2024-06-04 16:42:12,646 INFO L125 PetriNetUnfolderBase]: For 168523/168523 co-relation queries the response was YES. [2024-06-04 16:42:12,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9271 conditions, 1280 events. 732/1280 cut-off events. For 168523/168523 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6705 event pairs, 82 based on Foata normal form. 2/1281 useless extension candidates. Maximal degree in co-relation 9135. Up to 1181 conditions per place. [2024-06-04 16:42:12,659 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 258 selfloop transitions, 33 changer transitions 0/293 dead transitions. [2024-06-04 16:42:12,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 293 transitions, 3383 flow [2024-06-04 16:42:12,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:42:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:42:12,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-04 16:42:12,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3778409090909091 [2024-06-04 16:42:12,661 INFO L175 Difference]: Start difference. First operand has 302 places, 274 transitions, 2745 flow. Second operand 11 states and 133 transitions. [2024-06-04 16:42:12,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 293 transitions, 3383 flow [2024-06-04 16:42:13,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 293 transitions, 3311 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-04 16:42:13,180 INFO L231 Difference]: Finished difference. Result has 305 places, 274 transitions, 2744 flow [2024-06-04 16:42:13,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2673, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2744, PETRI_PLACES=305, PETRI_TRANSITIONS=274} [2024-06-04 16:42:13,180 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 274 predicate places. [2024-06-04 16:42:13,180 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 274 transitions, 2744 flow [2024-06-04 16:42:13,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:13,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:13,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:13,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-04 16:42:13,181 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-04 16:42:13,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:13,181 INFO L85 PathProgramCache]: Analyzing trace with hash -447906911, now seen corresponding path program 11 times [2024-06-04 16:42:13,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:13,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153403793] [2024-06-04 16:42:13,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:13,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:19,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:19,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:19,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153403793] [2024-06-04 16:42:19,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153403793] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:19,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:19,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:42:19,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894928037] [2024-06-04 16:42:19,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:19,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:42:19,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:19,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:42:19,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:42:19,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:42:19,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 274 transitions, 2744 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:19,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:19,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:42:19,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:20,456 INFO L124 PetriNetUnfolderBase]: 736/1288 cut-off events. [2024-06-04 16:42:20,456 INFO L125 PetriNetUnfolderBase]: For 171930/171930 co-relation queries the response was YES. [2024-06-04 16:42:20,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9338 conditions, 1288 events. 736/1288 cut-off events. For 171930/171930 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 6733 event pairs, 82 based on Foata normal form. 2/1289 useless extension candidates. Maximal degree in co-relation 9201. Up to 1178 conditions per place. [2024-06-04 16:42:20,469 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 248 selfloop transitions, 42 changer transitions 0/292 dead transitions. [2024-06-04 16:42:20,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 292 transitions, 3386 flow [2024-06-04 16:42:20,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:42:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:42:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-04 16:42:20,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-04 16:42:20,471 INFO L175 Difference]: Start difference. First operand has 305 places, 274 transitions, 2744 flow. Second operand 11 states and 134 transitions. [2024-06-04 16:42:20,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 292 transitions, 3386 flow [2024-06-04 16:42:21,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 292 transitions, 3302 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-04 16:42:21,052 INFO L231 Difference]: Finished difference. Result has 305 places, 275 transitions, 2766 flow [2024-06-04 16:42:21,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2660, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2766, PETRI_PLACES=305, PETRI_TRANSITIONS=275} [2024-06-04 16:42:21,052 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 274 predicate places. [2024-06-04 16:42:21,053 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 275 transitions, 2766 flow [2024-06-04 16:42:21,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:21,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:21,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:21,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-04 16:42:21,053 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-04 16:42:21,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:21,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2114671272, now seen corresponding path program 12 times [2024-06-04 16:42:21,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:21,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492724698] [2024-06-04 16:42:21,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:21,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:28,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:28,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492724698] [2024-06-04 16:42:28,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492724698] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:28,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:28,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:42:28,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056585897] [2024-06-04 16:42:28,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:28,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:42:28,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:28,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:42:28,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:42:28,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:42:28,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 275 transitions, 2766 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:28,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:28,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:42:28,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:28,869 INFO L124 PetriNetUnfolderBase]: 742/1298 cut-off events. [2024-06-04 16:42:28,869 INFO L125 PetriNetUnfolderBase]: For 175575/175575 co-relation queries the response was YES. [2024-06-04 16:42:28,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9425 conditions, 1298 events. 742/1298 cut-off events. For 175575/175575 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 6828 event pairs, 70 based on Foata normal form. 2/1299 useless extension candidates. Maximal degree in co-relation 9287. Up to 1158 conditions per place. [2024-06-04 16:42:28,883 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 251 selfloop transitions, 44 changer transitions 0/297 dead transitions. [2024-06-04 16:42:28,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 297 transitions, 3438 flow [2024-06-04 16:42:28,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:42:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:42:28,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-04 16:42:28,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-04 16:42:28,884 INFO L175 Difference]: Start difference. First operand has 305 places, 275 transitions, 2766 flow. Second operand 11 states and 138 transitions. [2024-06-04 16:42:28,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 297 transitions, 3438 flow [2024-06-04 16:42:29,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 297 transitions, 3329 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-04 16:42:29,391 INFO L231 Difference]: Finished difference. Result has 306 places, 277 transitions, 2776 flow [2024-06-04 16:42:29,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2657, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2776, PETRI_PLACES=306, PETRI_TRANSITIONS=277} [2024-06-04 16:42:29,391 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 275 predicate places. [2024-06-04 16:42:29,391 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 277 transitions, 2776 flow [2024-06-04 16:42:29,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:29,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:29,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:29,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-04 16:42:29,392 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-04 16:42:29,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:29,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2114461526, now seen corresponding path program 5 times [2024-06-04 16:42:29,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:29,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996754241] [2024-06-04 16:42:29,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:29,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:36,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:36,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:36,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996754241] [2024-06-04 16:42:36,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996754241] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:36,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:36,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:42:36,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195127827] [2024-06-04 16:42:36,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:36,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:42:36,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:36,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:42:36,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:42:36,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:42:36,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 277 transitions, 2776 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:36,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:36,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:42:36,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:37,433 INFO L124 PetriNetUnfolderBase]: 746/1306 cut-off events. [2024-06-04 16:42:37,433 INFO L125 PetriNetUnfolderBase]: For 178844/178844 co-relation queries the response was YES. [2024-06-04 16:42:37,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9491 conditions, 1306 events. 746/1306 cut-off events. For 178844/178844 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 6876 event pairs, 88 based on Foata normal form. 2/1307 useless extension candidates. Maximal degree in co-relation 9352. Up to 1214 conditions per place. [2024-06-04 16:42:37,446 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 262 selfloop transitions, 31 changer transitions 0/295 dead transitions. [2024-06-04 16:42:37,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 295 transitions, 3424 flow [2024-06-04 16:42:37,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:42:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:42:37,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-04 16:42:37,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-04 16:42:37,449 INFO L175 Difference]: Start difference. First operand has 306 places, 277 transitions, 2776 flow. Second operand 10 states and 132 transitions. [2024-06-04 16:42:37,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 295 transitions, 3424 flow [2024-06-04 16:42:38,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 295 transitions, 3325 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-04 16:42:38,044 INFO L231 Difference]: Finished difference. Result has 307 places, 278 transitions, 2759 flow [2024-06-04 16:42:38,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2677, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2759, PETRI_PLACES=307, PETRI_TRANSITIONS=278} [2024-06-04 16:42:38,045 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 276 predicate places. [2024-06-04 16:42:38,045 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 278 transitions, 2759 flow [2024-06-04 16:42:38,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:38,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:38,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:38,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-04 16:42:38,046 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-04 16:42:38,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:38,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1071026568, now seen corresponding path program 13 times [2024-06-04 16:42:38,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:38,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588543816] [2024-06-04 16:42:38,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:38,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:45,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:45,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:45,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588543816] [2024-06-04 16:42:45,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588543816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:45,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:45,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:42:45,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707337483] [2024-06-04 16:42:45,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:45,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:42:45,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:45,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:42:45,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:42:45,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:42:45,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 278 transitions, 2759 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:45,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:45,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:42:45,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:46,270 INFO L124 PetriNetUnfolderBase]: 742/1300 cut-off events. [2024-06-04 16:42:46,270 INFO L125 PetriNetUnfolderBase]: For 171787/171787 co-relation queries the response was YES. [2024-06-04 16:42:46,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9249 conditions, 1300 events. 742/1300 cut-off events. For 171787/171787 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 6851 event pairs, 79 based on Foata normal form. 2/1301 useless extension candidates. Maximal degree in co-relation 9109. Up to 1160 conditions per place. [2024-06-04 16:42:46,284 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 250 selfloop transitions, 45 changer transitions 0/297 dead transitions. [2024-06-04 16:42:46,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 297 transitions, 3405 flow [2024-06-04 16:42:46,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:42:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:42:46,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-04 16:42:46,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41761363636363635 [2024-06-04 16:42:46,285 INFO L175 Difference]: Start difference. First operand has 307 places, 278 transitions, 2759 flow. Second operand 11 states and 147 transitions. [2024-06-04 16:42:46,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 297 transitions, 3405 flow [2024-06-04 16:42:46,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 297 transitions, 3323 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-04 16:42:46,836 INFO L231 Difference]: Finished difference. Result has 310 places, 278 transitions, 2772 flow [2024-06-04 16:42:46,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2677, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2772, PETRI_PLACES=310, PETRI_TRANSITIONS=278} [2024-06-04 16:42:46,837 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 279 predicate places. [2024-06-04 16:42:46,837 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 278 transitions, 2772 flow [2024-06-04 16:42:46,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:46,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:46,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:46,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-04 16:42:46,838 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-04 16:42:46,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:46,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1065462378, now seen corresponding path program 14 times [2024-06-04 16:42:46,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:46,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544307098] [2024-06-04 16:42:46,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:46,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:55,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:55,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544307098] [2024-06-04 16:42:55,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544307098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:55,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:55,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:42:55,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579660270] [2024-06-04 16:42:55,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:55,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:42:55,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:55,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:42:55,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:42:55,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:42:55,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 278 transitions, 2772 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:55,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:55,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:42:55,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:56,021 INFO L124 PetriNetUnfolderBase]: 738/1294 cut-off events. [2024-06-04 16:42:56,021 INFO L125 PetriNetUnfolderBase]: For 164175/164175 co-relation queries the response was YES. [2024-06-04 16:42:56,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9051 conditions, 1294 events. 738/1294 cut-off events. For 164175/164175 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 6838 event pairs, 76 based on Foata normal form. 2/1295 useless extension candidates. Maximal degree in co-relation 8910. Up to 1154 conditions per place. [2024-06-04 16:42:56,035 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 249 selfloop transitions, 46 changer transitions 0/297 dead transitions. [2024-06-04 16:42:56,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 297 transitions, 3418 flow [2024-06-04 16:42:56,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:42:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:42:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-04 16:42:56,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-04 16:42:56,037 INFO L175 Difference]: Start difference. First operand has 310 places, 278 transitions, 2772 flow. Second operand 11 states and 135 transitions. [2024-06-04 16:42:56,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 297 transitions, 3418 flow [2024-06-04 16:42:56,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 297 transitions, 3313 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-04 16:42:56,569 INFO L231 Difference]: Finished difference. Result has 312 places, 278 transitions, 2764 flow [2024-06-04 16:42:56,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2667, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2764, PETRI_PLACES=312, PETRI_TRANSITIONS=278} [2024-06-04 16:42:56,570 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 281 predicate places. [2024-06-04 16:42:56,570 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 278 transitions, 2764 flow [2024-06-04 16:42:56,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:42:56,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:56,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:56,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-04 16:42:56,571 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-04 16:42:56,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:56,571 INFO L85 PathProgramCache]: Analyzing trace with hash -2120039387, now seen corresponding path program 12 times [2024-06-04 16:42:56,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:56,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264768896] [2024-06-04 16:42:56,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:56,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:02,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:02,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264768896] [2024-06-04 16:43:02,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264768896] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:02,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:02,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:43:02,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068840840] [2024-06-04 16:43:02,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:02,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:43:02,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:02,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:43:02,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:43:03,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:43:03,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 278 transitions, 2764 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:03,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:03,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:43:03,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:03,606 INFO L124 PetriNetUnfolderBase]: 742/1302 cut-off events. [2024-06-04 16:43:03,607 INFO L125 PetriNetUnfolderBase]: For 167563/167563 co-relation queries the response was YES. [2024-06-04 16:43:03,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9112 conditions, 1302 events. 742/1302 cut-off events. For 167563/167563 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 6872 event pairs, 82 based on Foata normal form. 2/1303 useless extension candidates. Maximal degree in co-relation 8970. Up to 1192 conditions per place. [2024-06-04 16:43:03,621 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 251 selfloop transitions, 43 changer transitions 0/296 dead transitions. [2024-06-04 16:43:03,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 296 transitions, 3416 flow [2024-06-04 16:43:03,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:43:03,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:43:03,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-04 16:43:03,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3778409090909091 [2024-06-04 16:43:03,623 INFO L175 Difference]: Start difference. First operand has 312 places, 278 transitions, 2764 flow. Second operand 11 states and 133 transitions. [2024-06-04 16:43:03,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 296 transitions, 3416 flow [2024-06-04 16:43:04,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 296 transitions, 3297 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-04 16:43:04,236 INFO L231 Difference]: Finished difference. Result has 312 places, 279 transitions, 2755 flow [2024-06-04 16:43:04,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2645, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2755, PETRI_PLACES=312, PETRI_TRANSITIONS=279} [2024-06-04 16:43:04,237 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 281 predicate places. [2024-06-04 16:43:04,237 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 279 transitions, 2755 flow [2024-06-04 16:43:04,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:04,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:04,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:04,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-04 16:43:04,238 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-04 16:43:04,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:04,239 INFO L85 PathProgramCache]: Analyzing trace with hash -453413441, now seen corresponding path program 13 times [2024-06-04 16:43:04,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:04,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605315838] [2024-06-04 16:43:04,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:04,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:10,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:10,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:10,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605315838] [2024-06-04 16:43:10,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605315838] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:10,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:10,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:43:10,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682133623] [2024-06-04 16:43:10,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:10,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:43:10,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:10,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:43:10,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:43:10,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:43:10,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 279 transitions, 2755 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:10,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:10,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:43:10,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:11,422 INFO L124 PetriNetUnfolderBase]: 746/1310 cut-off events. [2024-06-04 16:43:11,422 INFO L125 PetriNetUnfolderBase]: For 170587/170587 co-relation queries the response was YES. [2024-06-04 16:43:11,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9165 conditions, 1310 events. 746/1310 cut-off events. For 170587/170587 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 6930 event pairs, 86 based on Foata normal form. 2/1311 useless extension candidates. Maximal degree in co-relation 9022. Up to 1182 conditions per place. [2024-06-04 16:43:11,436 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 244 selfloop transitions, 52 changer transitions 0/298 dead transitions. [2024-06-04 16:43:11,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 298 transitions, 3415 flow [2024-06-04 16:43:11,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 16:43:11,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 16:43:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2024-06-04 16:43:11,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3723958333333333 [2024-06-04 16:43:11,439 INFO L175 Difference]: Start difference. First operand has 312 places, 279 transitions, 2755 flow. Second operand 12 states and 143 transitions. [2024-06-04 16:43:11,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 298 transitions, 3415 flow [2024-06-04 16:43:12,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 298 transitions, 3315 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-04 16:43:12,028 INFO L231 Difference]: Finished difference. Result has 315 places, 280 transitions, 2787 flow [2024-06-04 16:43:12,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2655, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2787, PETRI_PLACES=315, PETRI_TRANSITIONS=280} [2024-06-04 16:43:12,029 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 284 predicate places. [2024-06-04 16:43:12,029 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 280 transitions, 2787 flow [2024-06-04 16:43:12,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:12,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:12,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:12,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-04 16:43:12,029 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:43:12,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:12,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1610840237, now seen corresponding path program 14 times [2024-06-04 16:43:12,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:12,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110441108] [2024-06-04 16:43:12,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:12,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:19,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:19,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:19,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110441108] [2024-06-04 16:43:19,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110441108] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:19,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:19,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:43:19,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180779526] [2024-06-04 16:43:19,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:19,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:43:19,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:19,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:43:19,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:43:19,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:43:19,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 280 transitions, 2787 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:19,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:19,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:43:19,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:19,876 INFO L124 PetriNetUnfolderBase]: 750/1318 cut-off events. [2024-06-04 16:43:19,877 INFO L125 PetriNetUnfolderBase]: For 174016/174016 co-relation queries the response was YES. [2024-06-04 16:43:19,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9254 conditions, 1318 events. 750/1318 cut-off events. For 174016/174016 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 7010 event pairs, 82 based on Foata normal form. 2/1319 useless extension candidates. Maximal degree in co-relation 9110. Up to 1164 conditions per place. [2024-06-04 16:43:19,892 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 243 selfloop transitions, 54 changer transitions 0/299 dead transitions. [2024-06-04 16:43:19,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 299 transitions, 3451 flow [2024-06-04 16:43:19,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:43:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:43:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-04 16:43:19,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-04 16:43:19,894 INFO L175 Difference]: Start difference. First operand has 315 places, 280 transitions, 2787 flow. Second operand 11 states and 135 transitions. [2024-06-04 16:43:19,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 299 transitions, 3451 flow [2024-06-04 16:43:20,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 299 transitions, 3326 flow, removed 11 selfloop flow, removed 10 redundant places. [2024-06-04 16:43:20,489 INFO L231 Difference]: Finished difference. Result has 316 places, 281 transitions, 2798 flow [2024-06-04 16:43:20,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2664, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2798, PETRI_PLACES=316, PETRI_TRANSITIONS=281} [2024-06-04 16:43:20,489 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 285 predicate places. [2024-06-04 16:43:20,489 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 281 transitions, 2798 flow [2024-06-04 16:43:20,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:20,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:20,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:20,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-04 16:43:20,490 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:43:20,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:20,490 INFO L85 PathProgramCache]: Analyzing trace with hash 227128817, now seen corresponding path program 15 times [2024-06-04 16:43:20,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:20,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489779276] [2024-06-04 16:43:20,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:20,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:27,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:27,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489779276] [2024-06-04 16:43:27,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489779276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:27,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:27,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:43:27,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824544057] [2024-06-04 16:43:27,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:27,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:43:27,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:27,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:43:27,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:43:27,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:43:27,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 281 transitions, 2798 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:27,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:27,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:43:27,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:28,137 INFO L124 PetriNetUnfolderBase]: 770/1362 cut-off events. [2024-06-04 16:43:28,138 INFO L125 PetriNetUnfolderBase]: For 230992/230992 co-relation queries the response was YES. [2024-06-04 16:43:28,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9413 conditions, 1362 events. 770/1362 cut-off events. For 230992/230992 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 7277 event pairs, 94 based on Foata normal form. 12/1373 useless extension candidates. Maximal degree in co-relation 9268. Up to 1210 conditions per place. [2024-06-04 16:43:28,153 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 260 selfloop transitions, 30 changer transitions 9/301 dead transitions. [2024-06-04 16:43:28,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 301 transitions, 3490 flow [2024-06-04 16:43:28,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:43:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:43:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-04 16:43:28,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3664772727272727 [2024-06-04 16:43:28,154 INFO L175 Difference]: Start difference. First operand has 316 places, 281 transitions, 2798 flow. Second operand 11 states and 129 transitions. [2024-06-04 16:43:28,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 301 transitions, 3490 flow [2024-06-04 16:43:28,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 301 transitions, 3366 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-04 16:43:28,793 INFO L231 Difference]: Finished difference. Result has 318 places, 278 transitions, 2720 flow [2024-06-04 16:43:28,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2674, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2720, PETRI_PLACES=318, PETRI_TRANSITIONS=278} [2024-06-04 16:43:28,799 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 287 predicate places. [2024-06-04 16:43:28,799 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 278 transitions, 2720 flow [2024-06-04 16:43:28,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:28,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:28,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:28,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-04 16:43:28,808 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:43:28,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:28,810 INFO L85 PathProgramCache]: Analyzing trace with hash 168946286, now seen corresponding path program 6 times [2024-06-04 16:43:28,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:28,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118222694] [2024-06-04 16:43:28,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:28,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:35,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:35,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118222694] [2024-06-04 16:43:35,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118222694] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:35,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:35,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:43:35,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219979998] [2024-06-04 16:43:35,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:35,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:43:35,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:35,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:43:35,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:43:35,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:43:35,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 278 transitions, 2720 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:35,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:35,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:43:35,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:36,455 INFO L124 PetriNetUnfolderBase]: 758/1346 cut-off events. [2024-06-04 16:43:36,456 INFO L125 PetriNetUnfolderBase]: For 177112/177112 co-relation queries the response was YES. [2024-06-04 16:43:36,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9297 conditions, 1346 events. 758/1346 cut-off events. For 177112/177112 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 7233 event pairs, 102 based on Foata normal form. 2/1347 useless extension candidates. Maximal degree in co-relation 9151. Up to 1300 conditions per place. [2024-06-04 16:43:36,471 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 271 selfloop transitions, 18 changer transitions 0/291 dead transitions. [2024-06-04 16:43:36,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 291 transitions, 3342 flow [2024-06-04 16:43:36,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:43:36,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:43:36,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-04 16:43:36,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-04 16:43:36,472 INFO L175 Difference]: Start difference. First operand has 318 places, 278 transitions, 2720 flow. Second operand 10 states and 108 transitions. [2024-06-04 16:43:36,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 291 transitions, 3342 flow [2024-06-04 16:43:37,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 291 transitions, 3157 flow, removed 12 selfloop flow, removed 11 redundant places. [2024-06-04 16:43:37,124 INFO L231 Difference]: Finished difference. Result has 317 places, 279 transitions, 2593 flow [2024-06-04 16:43:37,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2535, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2593, PETRI_PLACES=317, PETRI_TRANSITIONS=279} [2024-06-04 16:43:37,125 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 286 predicate places. [2024-06-04 16:43:37,125 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 279 transitions, 2593 flow [2024-06-04 16:43:37,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:37,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:37,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:37,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-04 16:43:37,126 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:43:37,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:37,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1622178058, now seen corresponding path program 7 times [2024-06-04 16:43:37,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:37,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371193831] [2024-06-04 16:43:37,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:37,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:45,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:45,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371193831] [2024-06-04 16:43:45,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371193831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:45,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:45,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:43:45,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124402013] [2024-06-04 16:43:45,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:45,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:43:45,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:45,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:43:45,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:43:46,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:43:46,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 279 transitions, 2593 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:46,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:46,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:43:46,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:46,717 INFO L124 PetriNetUnfolderBase]: 762/1354 cut-off events. [2024-06-04 16:43:46,717 INFO L125 PetriNetUnfolderBase]: For 180204/180204 co-relation queries the response was YES. [2024-06-04 16:43:46,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9225 conditions, 1354 events. 762/1354 cut-off events. For 180204/180204 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 7296 event pairs, 96 based on Foata normal form. 2/1355 useless extension candidates. Maximal degree in co-relation 9079. Up to 1286 conditions per place. [2024-06-04 16:43:46,732 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 267 selfloop transitions, 25 changer transitions 0/294 dead transitions. [2024-06-04 16:43:46,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 294 transitions, 3233 flow [2024-06-04 16:43:46,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:43:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:43:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-04 16:43:46,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-04 16:43:46,734 INFO L175 Difference]: Start difference. First operand has 317 places, 279 transitions, 2593 flow. Second operand 10 states and 116 transitions. [2024-06-04 16:43:46,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 294 transitions, 3233 flow [2024-06-04 16:43:47,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 294 transitions, 3185 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-04 16:43:47,263 INFO L231 Difference]: Finished difference. Result has 319 places, 280 transitions, 2619 flow [2024-06-04 16:43:47,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2545, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2619, PETRI_PLACES=319, PETRI_TRANSITIONS=280} [2024-06-04 16:43:47,264 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 288 predicate places. [2024-06-04 16:43:47,264 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 280 transitions, 2619 flow [2024-06-04 16:43:47,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:47,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:47,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:47,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-04 16:43:47,265 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:43:47,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:47,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2020577190, now seen corresponding path program 8 times [2024-06-04 16:43:47,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:47,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409143256] [2024-06-04 16:43:47,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:47,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:54,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:54,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409143256] [2024-06-04 16:43:54,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409143256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:54,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:54,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:43:54,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895180734] [2024-06-04 16:43:54,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:54,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:43:54,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:54,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:43:54,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:43:54,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:43:54,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 280 transitions, 2619 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:54,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:54,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:43:54,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:55,016 INFO L124 PetriNetUnfolderBase]: 766/1362 cut-off events. [2024-06-04 16:43:55,017 INFO L125 PetriNetUnfolderBase]: For 183595/183595 co-relation queries the response was YES. [2024-06-04 16:43:55,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9314 conditions, 1362 events. 766/1362 cut-off events. For 183595/183595 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 7363 event pairs, 104 based on Foata normal form. 2/1363 useless extension candidates. Maximal degree in co-relation 9167. Up to 1316 conditions per place. [2024-06-04 16:43:55,032 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 272 selfloop transitions, 19 changer transitions 0/293 dead transitions. [2024-06-04 16:43:55,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 293 transitions, 3251 flow [2024-06-04 16:43:55,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:43:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:43:55,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-04 16:43:55,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.340625 [2024-06-04 16:43:55,034 INFO L175 Difference]: Start difference. First operand has 319 places, 280 transitions, 2619 flow. Second operand 10 states and 109 transitions. [2024-06-04 16:43:55,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 293 transitions, 3251 flow [2024-06-04 16:43:55,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 293 transitions, 3187 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 16:43:55,696 INFO L231 Difference]: Finished difference. Result has 321 places, 281 transitions, 2619 flow [2024-06-04 16:43:55,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2555, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2619, PETRI_PLACES=321, PETRI_TRANSITIONS=281} [2024-06-04 16:43:55,697 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 290 predicate places. [2024-06-04 16:43:55,697 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 281 transitions, 2619 flow [2024-06-04 16:43:55,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:43:55,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:55,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:55,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-04 16:43:55,704 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:43:55,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:55,705 INFO L85 PathProgramCache]: Analyzing trace with hash 324628842, now seen corresponding path program 15 times [2024-06-04 16:43:55,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:55,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751213050] [2024-06-04 16:43:55,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:55,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:44:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:44:02,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:44:02,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751213050] [2024-06-04 16:44:02,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751213050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:44:02,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:44:02,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-04 16:44:02,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102876572] [2024-06-04 16:44:02,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:44:02,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-04 16:44:02,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:44:02,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-04 16:44:02,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-04 16:44:03,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:44:03,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 281 transitions, 2619 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:03,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:44:03,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:44:03,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:44:03,685 INFO L124 PetriNetUnfolderBase]: 772/1372 cut-off events. [2024-06-04 16:44:03,686 INFO L125 PetriNetUnfolderBase]: For 186850/186850 co-relation queries the response was YES. [2024-06-04 16:44:03,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9353 conditions, 1372 events. 772/1372 cut-off events. For 186850/186850 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 7457 event pairs, 92 based on Foata normal form. 2/1373 useless extension candidates. Maximal degree in co-relation 9205. Up to 1286 conditions per place. [2024-06-04 16:44:03,697 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 268 selfloop transitions, 29 changer transitions 0/299 dead transitions. [2024-06-04 16:44:03,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 299 transitions, 3285 flow [2024-06-04 16:44:03,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:44:03,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:44:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-04 16:44:03,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36079545454545453 [2024-06-04 16:44:03,698 INFO L175 Difference]: Start difference. First operand has 321 places, 281 transitions, 2619 flow. Second operand 11 states and 127 transitions. [2024-06-04 16:44:03,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 299 transitions, 3285 flow [2024-06-04 16:44:04,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 299 transitions, 3194 flow, removed 11 selfloop flow, removed 10 redundant places. [2024-06-04 16:44:04,311 INFO L231 Difference]: Finished difference. Result has 322 places, 283 transitions, 2621 flow [2024-06-04 16:44:04,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2528, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2621, PETRI_PLACES=322, PETRI_TRANSITIONS=283} [2024-06-04 16:44:04,311 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 291 predicate places. [2024-06-04 16:44:04,312 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 283 transitions, 2621 flow [2024-06-04 16:44:04,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 16:44:04,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:44:04,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:44:04,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-04 16:44:04,313 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:44:04,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:44:04,313 INFO L85 PathProgramCache]: Analyzing trace with hash -89610454, now seen corresponding path program 9 times [2024-06-04 16:44:04,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:44:04,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720471894] [2024-06-04 16:44:04,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:44:04,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:44:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15