./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi004.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi004.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi004.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 15:40:45,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:40:45,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:40:45,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:40:45,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:40:45,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:40:45,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:40:45,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:40:45,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:40:45,892 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:40:45,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:40:45,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:40:45,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:40:45,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:40:45,895 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:40:45,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:40:45,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:40:45,896 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:40:45,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:40:45,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:40:45,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:40:45,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:40:45,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:40:45,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:40:45,897 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:40:45,898 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:40:45,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:40:45,898 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:40:45,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:40:45,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:40:45,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:40:45,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:40:45,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:40:45,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:40:45,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:40:45,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:40:45,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:40:45,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:40:45,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:40:45,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:40:45,901 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:40:45,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:40:45,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:40:45,902 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 15:40:46,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:40:46,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:40:46,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:40:46,170 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:40:46,171 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:40:46,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi004.yml/witness.yml [2024-06-14 15:40:46,320 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:40:46,320 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:40:46,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004.i [2024-06-14 15:40:47,385 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:40:47,632 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:40:47,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004.i [2024-06-14 15:40:47,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d21c778d/8f57028d21fb4d75b978ff6ba8bea0a5/FLAGf90ef6a32 [2024-06-14 15:40:47,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d21c778d/8f57028d21fb4d75b978ff6ba8bea0a5 [2024-06-14 15:40:47,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:40:47,690 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:40:47,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:40:47,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:40:47,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:40:47,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:40:46" (1/2) ... [2024-06-14 15:40:47,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e0d4fd5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:40:47, skipping insertion in model container [2024-06-14 15:40:47,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:40:46" (1/2) ... [2024-06-14 15:40:47,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@ef64a59 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:40:47, skipping insertion in model container [2024-06-14 15:40:47,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:40:47" (2/2) ... [2024-06-14 15:40:47,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e0d4fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:40:47, skipping insertion in model container [2024-06-14 15:40:47,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:40:47" (2/2) ... [2024-06-14 15:40:47,699 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:40:47,742 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:40:47,743 INFO L97 edCorrectnessWitness]: Location invariant before [L818-L818] (((((((((((((((((! multithreaded || y$r_buff1_thd0 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-14 15:40:47,743 INFO L97 edCorrectnessWitness]: Location invariant before [L819-L819] (((((((((((((((((! multithreaded || y$r_buff1_thd0 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1))) [2024-06-14 15:40:47,744 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:40:47,744 INFO L106 edCorrectnessWitness]: ghost_update [L816-L816] multithreaded = 1; [2024-06-14 15:40:47,767 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:40:48,068 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:40:48,077 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:40:48,413 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:40:48,461 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:40:48,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:40:48 WrapperNode [2024-06-14 15:40:48,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:40:48,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:40:48,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:40:48,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:40:48,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:40:48" (1/1) ... [2024-06-14 15:40:48,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:40:48" (1/1) ... [2024-06-14 15:40:48,577 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 121 [2024-06-14 15:40:48,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:40:48,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:40:48,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:40:48,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:40:48,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:40:48" (1/1) ... [2024-06-14 15:40:48,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:40:48" (1/1) ... [2024-06-14 15:40:48,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:40:48" (1/1) ... [2024-06-14 15:40:48,650 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-14 15:40:48,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:40:48" (1/1) ... [2024-06-14 15:40:48,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:40:48" (1/1) ... [2024-06-14 15:40:48,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:40:48" (1/1) ... [2024-06-14 15:40:48,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:40:48" (1/1) ... [2024-06-14 15:40:48,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:40:48" (1/1) ... [2024-06-14 15:40:48,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:40:48" (1/1) ... [2024-06-14 15:40:48,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:40:48,726 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:40:48,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:40:48,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:40:48,727 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:40:48" (1/1) ... [2024-06-14 15:40:48,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:40:48,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:40:48,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 15:40:48,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 15:40:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:40:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:40:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:40:48,804 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:40:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:40:48,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:40:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:40:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:40:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:40:48,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:40:48,807 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 15:40:48,939 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:40:48,941 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:40:49,753 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:40:49,754 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:40:49,892 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:40:49,893 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:40:49,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:40:49 BoogieIcfgContainer [2024-06-14 15:40:49,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:40:49,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:40:49,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:40:49,897 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:40:49,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:40:46" (1/4) ... [2024-06-14 15:40:49,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aad18a4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:40:49, skipping insertion in model container [2024-06-14 15:40:49,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:40:47" (2/4) ... [2024-06-14 15:40:49,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aad18a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:40:49, skipping insertion in model container [2024-06-14 15:40:49,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:40:48" (3/4) ... [2024-06-14 15:40:49,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aad18a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:40:49, skipping insertion in model container [2024-06-14 15:40:49,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:40:49" (4/4) ... [2024-06-14 15:40:49,900 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004.i [2024-06-14 15:40:49,913 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:40:49,913 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 15:40:49,913 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:40:49,984 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:40:50,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 74 flow [2024-06-14 15:40:50,037 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-06-14 15:40:50,038 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:40:50,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 15:40:50,039 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 33 transitions, 74 flow [2024-06-14 15:40:50,042 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 56 flow [2024-06-14 15:40:50,048 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:40:50,053 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;@18a07ef7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:40:50,053 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 15:40:50,059 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:40:50,059 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 15:40:50,059 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:40:50,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:50,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:40:50,061 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:40:50,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:50,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1590784768, now seen corresponding path program 1 times [2024-06-14 15:40:50,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:50,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585409410] [2024-06-14 15:40:50,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:50,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:40:54,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:54,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585409410] [2024-06-14 15:40:54,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585409410] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:54,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:54,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:40:54,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464900387] [2024-06-14 15:40:54,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:54,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:40:54,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:54,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:40:54,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:40:54,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2024-06-14 15:40:54,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:54,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:54,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2024-06-14 15:40:54,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:54,939 INFO L124 PetriNetUnfolderBase]: 131/270 cut-off events. [2024-06-14 15:40:54,939 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-14 15:40:54,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 270 events. 131/270 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1073 event pairs, 75 based on Foata normal form. 1/257 useless extension candidates. Maximal degree in co-relation 514. Up to 235 conditions per place. [2024-06-14 15:40:54,945 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 22 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-06-14 15:40:54,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 121 flow [2024-06-14 15:40:54,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:40:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:40:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-06-14 15:40:54,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-06-14 15:40:54,956 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 56 flow. Second operand 3 states and 60 transitions. [2024-06-14 15:40:54,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 121 flow [2024-06-14 15:40:54,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 15:40:54,959 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 75 flow [2024-06-14 15:40:54,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2024-06-14 15:40:54,963 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2024-06-14 15:40:54,963 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 75 flow [2024-06-14 15:40:54,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:54,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:54,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:40:54,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:40:54,965 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:40:54,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:54,966 INFO L85 PathProgramCache]: Analyzing trace with hash -263456755, now seen corresponding path program 1 times [2024-06-14 15:40:54,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:54,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973201055] [2024-06-14 15:40:54,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:54,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:40:58,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-14 15:40:58,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:40:58,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973201055] [2024-06-14 15:40:58,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973201055] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:40:58,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:40:58,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:40:58,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081859847] [2024-06-14 15:40:58,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:40:58,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:40:58,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:40:58,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:40:58,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:40:58,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-14 15:40:58,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:58,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:40:58,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-14 15:40:58,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:40:58,271 INFO L124 PetriNetUnfolderBase]: 150/299 cut-off events. [2024-06-14 15:40:58,271 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-06-14 15:40:58,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 299 events. 150/299 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1188 event pairs, 68 based on Foata normal form. 2/297 useless extension candidates. Maximal degree in co-relation 654. Up to 258 conditions per place. [2024-06-14 15:40:58,276 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 27 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2024-06-14 15:40:58,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 165 flow [2024-06-14 15:40:58,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:40:58,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:40:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2024-06-14 15:40:58,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-06-14 15:40:58,280 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 75 flow. Second operand 4 states and 74 transitions. [2024-06-14 15:40:58,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 165 flow [2024-06-14 15:40:58,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 162 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:40:58,281 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 99 flow [2024-06-14 15:40:58,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2024-06-14 15:40:58,282 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2024-06-14 15:40:58,282 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 99 flow [2024-06-14 15:40:58,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:40:58,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:40:58,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:40:58,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:40:58,283 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:40:58,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:40:58,284 INFO L85 PathProgramCache]: Analyzing trace with hash -471492034, now seen corresponding path program 1 times [2024-06-14 15:40:58,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:40:58,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022620425] [2024-06-14 15:40:58,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:40:58,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:40:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:02,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:02,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022620425] [2024-06-14 15:41:02,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022620425] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:02,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:02,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:41:02,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37071567] [2024-06-14 15:41:02,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:02,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:41:02,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:02,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:41:02,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:41:02,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-14 15:41:02,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:02,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:02,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-14 15:41:02,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:02,886 INFO L124 PetriNetUnfolderBase]: 147/293 cut-off events. [2024-06-14 15:41:02,886 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2024-06-14 15:41:02,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 293 events. 147/293 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1145 event pairs, 47 based on Foata normal form. 2/290 useless extension candidates. Maximal degree in co-relation 714. Up to 244 conditions per place. [2024-06-14 15:41:02,889 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 31 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-14 15:41:02,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 213 flow [2024-06-14 15:41:02,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:41:02,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:41:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-06-14 15:41:02,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-06-14 15:41:02,890 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 99 flow. Second operand 5 states and 90 transitions. [2024-06-14 15:41:02,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 213 flow [2024-06-14 15:41:02,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 204 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 15:41:02,892 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 123 flow [2024-06-14 15:41:02,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-06-14 15:41:02,893 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2024-06-14 15:41:02,893 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 123 flow [2024-06-14 15:41:02,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:02,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:02,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:02,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:41:02,894 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-14 15:41:02,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:02,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1918731910, now seen corresponding path program 1 times [2024-06-14 15:41:02,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:02,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251937909] [2024-06-14 15:41:02,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:02,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:09,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:09,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251937909] [2024-06-14 15:41:09,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251937909] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:09,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:09,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:41:09,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842416034] [2024-06-14 15:41:09,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:09,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:41:09,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:09,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:41:09,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:41:09,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-14 15:41:09,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:09,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:09,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-14 15:41:09,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:09,380 INFO L124 PetriNetUnfolderBase]: 123/265 cut-off events. [2024-06-14 15:41:09,382 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2024-06-14 15:41:09,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 265 events. 123/265 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1036 event pairs, 38 based on Foata normal form. 1/261 useless extension candidates. Maximal degree in co-relation 693. Up to 219 conditions per place. [2024-06-14 15:41:09,383 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 26 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2024-06-14 15:41:09,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 205 flow [2024-06-14 15:41:09,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:41:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:41:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2024-06-14 15:41:09,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2024-06-14 15:41:09,388 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 123 flow. Second operand 5 states and 79 transitions. [2024-06-14 15:41:09,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 205 flow [2024-06-14 15:41:09,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 190 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 15:41:09,391 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 135 flow [2024-06-14 15:41:09,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2024-06-14 15:41:09,393 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2024-06-14 15:41:09,393 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 135 flow [2024-06-14 15:41:09,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:09,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:09,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:09,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:41:09,394 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:09,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:09,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2132256803, now seen corresponding path program 1 times [2024-06-14 15:41:09,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:09,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456100594] [2024-06-14 15:41:09,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:09,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:13,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:13,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:13,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456100594] [2024-06-14 15:41:13,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456100594] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:13,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:13,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:41:13,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882043164] [2024-06-14 15:41:13,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:13,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:41:13,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:13,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:41:13,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:41:13,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-14 15:41:13,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:13,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:13,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-14 15:41:13,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:14,009 INFO L124 PetriNetUnfolderBase]: 141/280 cut-off events. [2024-06-14 15:41:14,009 INFO L125 PetriNetUnfolderBase]: For 410/410 co-relation queries the response was YES. [2024-06-14 15:41:14,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 280 events. 141/280 cut-off events. For 410/410 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1052 event pairs, 24 based on Foata normal form. 4/282 useless extension candidates. Maximal degree in co-relation 794. Up to 215 conditions per place. [2024-06-14 15:41:14,011 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 33 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2024-06-14 15:41:14,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 243 flow [2024-06-14 15:41:14,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:41:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:41:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-14 15:41:14,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51010101010101 [2024-06-14 15:41:14,014 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 135 flow. Second operand 6 states and 101 transitions. [2024-06-14 15:41:14,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 243 flow [2024-06-14 15:41:14,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 232 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 15:41:14,016 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 136 flow [2024-06-14 15:41:14,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2024-06-14 15:41:14,016 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2024-06-14 15:41:14,017 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 136 flow [2024-06-14 15:41:14,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:14,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:14,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:14,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:41:14,017 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:14,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:14,018 INFO L85 PathProgramCache]: Analyzing trace with hash 648853829, now seen corresponding path program 1 times [2024-06-14 15:41:14,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:14,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103240295] [2024-06-14 15:41:14,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:14,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:20,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:20,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103240295] [2024-06-14 15:41:20,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103240295] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:20,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:20,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:41:20,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178629640] [2024-06-14 15:41:20,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:20,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:41:20,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:20,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:41:20,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:41:20,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:41:20,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 136 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:20,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:20,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:41:20,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:20,454 INFO L124 PetriNetUnfolderBase]: 139/281 cut-off events. [2024-06-14 15:41:20,454 INFO L125 PetriNetUnfolderBase]: For 560/560 co-relation queries the response was YES. [2024-06-14 15:41:20,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 281 events. 139/281 cut-off events. For 560/560 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1091 event pairs, 41 based on Foata normal form. 1/280 useless extension candidates. Maximal degree in co-relation 832. Up to 242 conditions per place. [2024-06-14 15:41:20,456 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 27 selfloop transitions, 8 changer transitions 0/40 dead transitions. [2024-06-14 15:41:20,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 228 flow [2024-06-14 15:41:20,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:41:20,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:41:20,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2024-06-14 15:41:20,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43434343434343436 [2024-06-14 15:41:20,458 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 136 flow. Second operand 6 states and 86 transitions. [2024-06-14 15:41:20,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 228 flow [2024-06-14 15:41:20,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 208 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 15:41:20,461 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 149 flow [2024-06-14 15:41:20,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-06-14 15:41:20,462 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2024-06-14 15:41:20,462 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 149 flow [2024-06-14 15:41:20,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:20,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:20,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:20,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:41:20,463 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:20,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:20,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1367042023, now seen corresponding path program 1 times [2024-06-14 15:41:20,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:20,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941961110] [2024-06-14 15:41:20,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:20,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:26,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:26,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941961110] [2024-06-14 15:41:26,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941961110] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:26,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:26,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:41:26,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360138388] [2024-06-14 15:41:26,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:26,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:41:26,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:26,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:41:26,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:41:27,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:41:27,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 149 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:27,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:27,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:41:27,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:27,341 INFO L124 PetriNetUnfolderBase]: 156/307 cut-off events. [2024-06-14 15:41:27,341 INFO L125 PetriNetUnfolderBase]: For 861/861 co-relation queries the response was YES. [2024-06-14 15:41:27,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 307 events. 156/307 cut-off events. For 861/861 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1212 event pairs, 46 based on Foata normal form. 2/307 useless extension candidates. Maximal degree in co-relation 968. Up to 255 conditions per place. [2024-06-14 15:41:27,343 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 32 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2024-06-14 15:41:27,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 263 flow [2024-06-14 15:41:27,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:41:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:41:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2024-06-14 15:41:27,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-14 15:41:27,345 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 149 flow. Second operand 6 states and 90 transitions. [2024-06-14 15:41:27,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 263 flow [2024-06-14 15:41:27,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 246 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:41:27,346 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 165 flow [2024-06-14 15:41:27,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2024-06-14 15:41:27,347 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2024-06-14 15:41:27,347 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 165 flow [2024-06-14 15:41:27,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:27,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:27,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:27,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:41:27,348 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:27,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:27,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1360375783, now seen corresponding path program 2 times [2024-06-14 15:41:27,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:27,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879156545] [2024-06-14 15:41:27,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:27,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:33,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:33,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:33,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879156545] [2024-06-14 15:41:33,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879156545] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:33,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:33,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:41:33,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660638941] [2024-06-14 15:41:33,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:33,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:41:33,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:33,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:41:33,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:41:33,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:41:33,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 165 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:33,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:33,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:41:33,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:34,135 INFO L124 PetriNetUnfolderBase]: 155/309 cut-off events. [2024-06-14 15:41:34,135 INFO L125 PetriNetUnfolderBase]: For 1122/1122 co-relation queries the response was YES. [2024-06-14 15:41:34,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 309 events. 155/309 cut-off events. For 1122/1122 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1226 event pairs, 45 based on Foata normal form. 2/309 useless extension candidates. Maximal degree in co-relation 1039. Up to 246 conditions per place. [2024-06-14 15:41:34,137 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 32 selfloop transitions, 12 changer transitions 0/50 dead transitions. [2024-06-14 15:41:34,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 297 flow [2024-06-14 15:41:34,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:41:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:41:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2024-06-14 15:41:34,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45021645021645024 [2024-06-14 15:41:34,138 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 165 flow. Second operand 7 states and 104 transitions. [2024-06-14 15:41:34,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 297 flow [2024-06-14 15:41:34,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 280 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:41:34,141 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 193 flow [2024-06-14 15:41:34,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=193, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-06-14 15:41:34,142 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2024-06-14 15:41:34,144 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 193 flow [2024-06-14 15:41:34,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:34,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:34,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:34,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:41:34,145 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:34,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:34,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1360366855, now seen corresponding path program 1 times [2024-06-14 15:41:34,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:34,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657151297] [2024-06-14 15:41:34,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:34,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:40,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:40,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657151297] [2024-06-14 15:41:40,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657151297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:40,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:40,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:41:40,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837690372] [2024-06-14 15:41:40,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:40,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:41:40,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:40,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:41:40,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:41:40,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:41:40,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 193 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:40,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:40,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:41:40,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:40,749 INFO L124 PetriNetUnfolderBase]: 144/292 cut-off events. [2024-06-14 15:41:40,750 INFO L125 PetriNetUnfolderBase]: For 1122/1122 co-relation queries the response was YES. [2024-06-14 15:41:40,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 292 events. 144/292 cut-off events. For 1122/1122 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1130 event pairs, 39 based on Foata normal form. 1/291 useless extension candidates. Maximal degree in co-relation 1019. Up to 248 conditions per place. [2024-06-14 15:41:40,752 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 32 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2024-06-14 15:41:40,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 303 flow [2024-06-14 15:41:40,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:41:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:41:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-14 15:41:40,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-14 15:41:40,753 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 193 flow. Second operand 7 states and 98 transitions. [2024-06-14 15:41:40,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 303 flow [2024-06-14 15:41:40,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 47 transitions, 274 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 15:41:40,755 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 203 flow [2024-06-14 15:41:40,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2024-06-14 15:41:40,756 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2024-06-14 15:41:40,756 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 203 flow [2024-06-14 15:41:40,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:40,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:40,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:40,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:41:40,756 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:40,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:40,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1130930954, now seen corresponding path program 1 times [2024-06-14 15:41:40,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:40,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999980513] [2024-06-14 15:41:40,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:40,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:47,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-14 15:41:47,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:47,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999980513] [2024-06-14 15:41:47,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999980513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:47,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:47,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:41:47,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672639254] [2024-06-14 15:41:47,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:47,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:41:47,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:47,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:41:47,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:41:47,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:41:47,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 203 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:47,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:47,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:41:47,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:47,519 INFO L124 PetriNetUnfolderBase]: 170/328 cut-off events. [2024-06-14 15:41:47,519 INFO L125 PetriNetUnfolderBase]: For 1546/1546 co-relation queries the response was YES. [2024-06-14 15:41:47,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 328 events. 170/328 cut-off events. For 1546/1546 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1298 event pairs, 45 based on Foata normal form. 2/328 useless extension candidates. Maximal degree in co-relation 1199. Up to 278 conditions per place. [2024-06-14 15:41:47,522 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 40 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2024-06-14 15:41:47,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 347 flow [2024-06-14 15:41:47,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:41:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:41:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-14 15:41:47,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4199134199134199 [2024-06-14 15:41:47,524 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 203 flow. Second operand 7 states and 97 transitions. [2024-06-14 15:41:47,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 347 flow [2024-06-14 15:41:47,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 54 transitions, 324 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-14 15:41:47,530 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 221 flow [2024-06-14 15:41:47,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=221, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-06-14 15:41:47,532 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2024-06-14 15:41:47,533 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 221 flow [2024-06-14 15:41:47,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:47,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:47,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:47,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:41:47,533 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:47,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:47,534 INFO L85 PathProgramCache]: Analyzing trace with hash 778291492, now seen corresponding path program 2 times [2024-06-14 15:41:47,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:47,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043048091] [2024-06-14 15:41:47,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:47,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:54,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:54,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:54,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043048091] [2024-06-14 15:41:54,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043048091] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:54,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:54,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:41:54,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725613901] [2024-06-14 15:41:54,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:54,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:41:54,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:54,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:41:54,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:41:54,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:41:54,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 221 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:54,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:54,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:41:54,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:54,558 INFO L124 PetriNetUnfolderBase]: 181/348 cut-off events. [2024-06-14 15:41:54,559 INFO L125 PetriNetUnfolderBase]: For 1968/1968 co-relation queries the response was YES. [2024-06-14 15:41:54,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 348 events. 181/348 cut-off events. For 1968/1968 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1407 event pairs, 45 based on Foata normal form. 2/348 useless extension candidates. Maximal degree in co-relation 1347. Up to 267 conditions per place. [2024-06-14 15:41:54,561 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 38 selfloop transitions, 19 changer transitions 0/61 dead transitions. [2024-06-14 15:41:54,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 427 flow [2024-06-14 15:41:54,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:41:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:41:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2024-06-14 15:41:54,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-14 15:41:54,563 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 221 flow. Second operand 8 states and 112 transitions. [2024-06-14 15:41:54,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 61 transitions, 427 flow [2024-06-14 15:41:54,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 61 transitions, 402 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 15:41:54,565 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 275 flow [2024-06-14 15:41:54,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=275, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2024-06-14 15:41:54,566 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 25 predicate places. [2024-06-14 15:41:54,566 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 275 flow [2024-06-14 15:41:54,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:54,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:54,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:54,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:41:54,567 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:54,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:54,567 INFO L85 PathProgramCache]: Analyzing trace with hash 778024582, now seen corresponding path program 3 times [2024-06-14 15:41:54,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:54,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826433999] [2024-06-14 15:41:54,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:54,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:01,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:01,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:01,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826433999] [2024-06-14 15:42:01,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826433999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:01,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:01,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:42:01,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520275057] [2024-06-14 15:42:01,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:01,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:42:01,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:01,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:42:01,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:42:01,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:42:01,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 275 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:01,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:01,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:42:01,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:01,443 INFO L124 PetriNetUnfolderBase]: 179/349 cut-off events. [2024-06-14 15:42:01,444 INFO L125 PetriNetUnfolderBase]: For 2357/2357 co-relation queries the response was YES. [2024-06-14 15:42:01,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 349 events. 179/349 cut-off events. For 2357/2357 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1421 event pairs, 45 based on Foata normal form. 1/348 useless extension candidates. Maximal degree in co-relation 1418. Up to 286 conditions per place. [2024-06-14 15:42:01,446 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 45 selfloop transitions, 16 changer transitions 0/65 dead transitions. [2024-06-14 15:42:01,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 65 transitions, 472 flow [2024-06-14 15:42:01,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:42:01,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:42:01,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-14 15:42:01,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4128787878787879 [2024-06-14 15:42:01,448 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 275 flow. Second operand 8 states and 109 transitions. [2024-06-14 15:42:01,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 65 transitions, 472 flow [2024-06-14 15:42:01,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 65 transitions, 439 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-14 15:42:01,451 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 343 flow [2024-06-14 15:42:01,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=343, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2024-06-14 15:42:01,453 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 31 predicate places. [2024-06-14 15:42:01,454 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 343 flow [2024-06-14 15:42:01,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:01,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:01,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:01,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:42:01,454 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:01,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:01,455 INFO L85 PathProgramCache]: Analyzing trace with hash 527868600, now seen corresponding path program 1 times [2024-06-14 15:42:01,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:01,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330747462] [2024-06-14 15:42:01,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:01,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:08,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:08,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330747462] [2024-06-14 15:42:08,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330747462] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:08,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:08,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:42:08,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558935210] [2024-06-14 15:42:08,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:08,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:42:08,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:08,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:42:08,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:42:08,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:42:08,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 343 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:08,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:08,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:42:08,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:08,653 INFO L124 PetriNetUnfolderBase]: 169/338 cut-off events. [2024-06-14 15:42:08,653 INFO L125 PetriNetUnfolderBase]: For 2675/2675 co-relation queries the response was YES. [2024-06-14 15:42:08,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 338 events. 169/338 cut-off events. For 2675/2675 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1409 event pairs, 43 based on Foata normal form. 1/337 useless extension candidates. Maximal degree in co-relation 1443. Up to 260 conditions per place. [2024-06-14 15:42:08,656 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 46 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2024-06-14 15:42:08,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 507 flow [2024-06-14 15:42:08,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:42:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:42:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2024-06-14 15:42:08,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45021645021645024 [2024-06-14 15:42:08,657 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 343 flow. Second operand 7 states and 104 transitions. [2024-06-14 15:42:08,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 507 flow [2024-06-14 15:42:08,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 489 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-14 15:42:08,660 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 374 flow [2024-06-14 15:42:08,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=374, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-06-14 15:42:08,661 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 35 predicate places. [2024-06-14 15:42:08,661 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 374 flow [2024-06-14 15:42:08,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:08,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:08,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:08,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:42:08,661 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:08,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:08,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1878941958, now seen corresponding path program 1 times [2024-06-14 15:42:08,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:08,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747776363] [2024-06-14 15:42:08,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:08,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:15,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:15,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:15,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747776363] [2024-06-14 15:42:15,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747776363] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:15,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:15,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:42:15,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638301088] [2024-06-14 15:42:15,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:15,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:42:15,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:15,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:42:15,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:42:15,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:42:15,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 374 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:15,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:15,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:42:15,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:15,758 INFO L124 PetriNetUnfolderBase]: 183/354 cut-off events. [2024-06-14 15:42:15,758 INFO L125 PetriNetUnfolderBase]: For 3093/3093 co-relation queries the response was YES. [2024-06-14 15:42:15,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1613 conditions, 354 events. 183/354 cut-off events. For 3093/3093 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1442 event pairs, 43 based on Foata normal form. 2/354 useless extension candidates. Maximal degree in co-relation 1580. Up to 292 conditions per place. [2024-06-14 15:42:15,761 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 53 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2024-06-14 15:42:15,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 559 flow [2024-06-14 15:42:15,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:42:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:42:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-14 15:42:15,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4128787878787879 [2024-06-14 15:42:15,762 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 374 flow. Second operand 8 states and 109 transitions. [2024-06-14 15:42:15,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 559 flow [2024-06-14 15:42:15,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 70 transitions, 526 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-14 15:42:15,765 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 393 flow [2024-06-14 15:42:15,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=393, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2024-06-14 15:42:15,766 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2024-06-14 15:42:15,766 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 393 flow [2024-06-14 15:42:15,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:15,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:15,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:15,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:42:15,767 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:15,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:15,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1651040808, now seen corresponding path program 2 times [2024-06-14 15:42:15,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:15,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495964555] [2024-06-14 15:42:15,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:15,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:22,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:22,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495964555] [2024-06-14 15:42:22,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495964555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:22,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:22,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:42:22,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320520727] [2024-06-14 15:42:22,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:22,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:42:22,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:22,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:42:22,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:42:22,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:42:22,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 393 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:22,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:22,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:42:22,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:22,985 INFO L124 PetriNetUnfolderBase]: 195/376 cut-off events. [2024-06-14 15:42:22,986 INFO L125 PetriNetUnfolderBase]: For 3800/3800 co-relation queries the response was YES. [2024-06-14 15:42:22,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1784 conditions, 376 events. 195/376 cut-off events. For 3800/3800 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1577 event pairs, 45 based on Foata normal form. 2/376 useless extension candidates. Maximal degree in co-relation 1750. Up to 260 conditions per place. [2024-06-14 15:42:22,989 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 51 selfloop transitions, 25 changer transitions 0/80 dead transitions. [2024-06-14 15:42:22,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 80 transitions, 699 flow [2024-06-14 15:42:22,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:42:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:42:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2024-06-14 15:42:22,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43097643097643096 [2024-06-14 15:42:22,990 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 393 flow. Second operand 9 states and 128 transitions. [2024-06-14 15:42:22,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 80 transitions, 699 flow [2024-06-14 15:42:22,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 80 transitions, 665 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 15:42:22,994 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 479 flow [2024-06-14 15:42:22,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=479, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2024-06-14 15:42:22,995 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 42 predicate places. [2024-06-14 15:42:22,995 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 479 flow [2024-06-14 15:42:22,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:22,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:22,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:22,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:42:22,996 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:22,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:22,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1642766598, now seen corresponding path program 3 times [2024-06-14 15:42:22,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:22,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138684545] [2024-06-14 15:42:22,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:22,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:29,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:29,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138684545] [2024-06-14 15:42:29,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138684545] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:29,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:29,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:42:29,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353590905] [2024-06-14 15:42:29,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:29,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:42:29,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:29,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:42:29,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:42:29,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:42:29,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 479 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:29,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:29,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:42:29,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:30,099 INFO L124 PetriNetUnfolderBase]: 201/392 cut-off events. [2024-06-14 15:42:30,099 INFO L125 PetriNetUnfolderBase]: For 4583/4583 co-relation queries the response was YES. [2024-06-14 15:42:30,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1950 conditions, 392 events. 201/392 cut-off events. For 4583/4583 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1669 event pairs, 44 based on Foata normal form. 2/392 useless extension candidates. Maximal degree in co-relation 1914. Up to 266 conditions per place. [2024-06-14 15:42:30,102 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 52 selfloop transitions, 28 changer transitions 0/84 dead transitions. [2024-06-14 15:42:30,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 84 transitions, 783 flow [2024-06-14 15:42:30,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:42:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:42:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2024-06-14 15:42:30,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4276094276094276 [2024-06-14 15:42:30,103 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 479 flow. Second operand 9 states and 127 transitions. [2024-06-14 15:42:30,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 84 transitions, 783 flow [2024-06-14 15:42:30,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 84 transitions, 747 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-14 15:42:30,109 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 529 flow [2024-06-14 15:42:30,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=529, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2024-06-14 15:42:30,109 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 47 predicate places. [2024-06-14 15:42:30,110 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 529 flow [2024-06-14 15:42:30,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:30,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:30,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:30,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:42:30,110 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:30,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:30,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1642469928, now seen corresponding path program 4 times [2024-06-14 15:42:30,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:30,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587612208] [2024-06-14 15:42:30,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:30,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:36,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:36,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:36,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587612208] [2024-06-14 15:42:36,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587612208] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:36,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:36,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:42:36,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434905953] [2024-06-14 15:42:36,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:36,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:42:36,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:36,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:42:36,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:42:36,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:42:36,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 65 transitions, 529 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:36,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:36,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:42:36,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:37,295 INFO L124 PetriNetUnfolderBase]: 197/386 cut-off events. [2024-06-14 15:42:37,295 INFO L125 PetriNetUnfolderBase]: For 4836/4836 co-relation queries the response was YES. [2024-06-14 15:42:37,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1960 conditions, 386 events. 197/386 cut-off events. For 4836/4836 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1639 event pairs, 43 based on Foata normal form. 2/386 useless extension candidates. Maximal degree in co-relation 1922. Up to 263 conditions per place. [2024-06-14 15:42:37,298 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 46 selfloop transitions, 32 changer transitions 0/82 dead transitions. [2024-06-14 15:42:37,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 82 transitions, 769 flow [2024-06-14 15:42:37,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:42:37,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:42:37,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2024-06-14 15:42:37,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4208754208754209 [2024-06-14 15:42:37,300 INFO L175 Difference]: Start difference. First operand has 79 places, 65 transitions, 529 flow. Second operand 9 states and 125 transitions. [2024-06-14 15:42:37,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 82 transitions, 769 flow [2024-06-14 15:42:37,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 82 transitions, 696 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-14 15:42:37,305 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 525 flow [2024-06-14 15:42:37,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=525, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2024-06-14 15:42:37,305 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 50 predicate places. [2024-06-14 15:42:37,305 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 525 flow [2024-06-14 15:42:37,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:37,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:37,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:37,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:42:37,306 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:37,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:37,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1642459016, now seen corresponding path program 1 times [2024-06-14 15:42:37,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:37,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109772390] [2024-06-14 15:42:37,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:37,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:44,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:44,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109772390] [2024-06-14 15:42:44,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109772390] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:44,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:44,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:42:44,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241565505] [2024-06-14 15:42:44,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:44,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:42:44,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:44,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:42:44,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:42:44,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:42:44,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 525 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:44,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:44,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:42:44,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:45,053 INFO L124 PetriNetUnfolderBase]: 195/381 cut-off events. [2024-06-14 15:42:45,053 INFO L125 PetriNetUnfolderBase]: For 4900/4900 co-relation queries the response was YES. [2024-06-14 15:42:45,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1953 conditions, 381 events. 195/381 cut-off events. For 4900/4900 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1610 event pairs, 44 based on Foata normal form. 1/380 useless extension candidates. Maximal degree in co-relation 1914. Up to 329 conditions per place. [2024-06-14 15:42:45,056 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 58 selfloop transitions, 14 changer transitions 0/76 dead transitions. [2024-06-14 15:42:45,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 76 transitions, 701 flow [2024-06-14 15:42:45,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:42:45,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:42:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 15:42:45,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2024-06-14 15:42:45,058 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 525 flow. Second operand 9 states and 114 transitions. [2024-06-14 15:42:45,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 76 transitions, 701 flow [2024-06-14 15:42:45,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 76 transitions, 646 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 15:42:45,062 INFO L231 Difference]: Finished difference. Result has 84 places, 67 transitions, 519 flow [2024-06-14 15:42:45,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=519, PETRI_PLACES=84, PETRI_TRANSITIONS=67} [2024-06-14 15:42:45,063 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 52 predicate places. [2024-06-14 15:42:45,063 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 67 transitions, 519 flow [2024-06-14 15:42:45,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:45,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:45,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:45,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:42:45,064 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:45,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:45,064 INFO L85 PathProgramCache]: Analyzing trace with hash -815941689, now seen corresponding path program 1 times [2024-06-14 15:42:45,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:45,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121316885] [2024-06-14 15:42:45,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:45,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:51,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:51,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:51,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121316885] [2024-06-14 15:42:51,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121316885] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:51,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:51,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:42:51,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327284358] [2024-06-14 15:42:51,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:51,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:42:51,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:51,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:42:51,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:42:51,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:42:51,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 67 transitions, 519 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:51,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:51,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:42:51,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:52,318 INFO L124 PetriNetUnfolderBase]: 193/378 cut-off events. [2024-06-14 15:42:52,318 INFO L125 PetriNetUnfolderBase]: For 4963/4963 co-relation queries the response was YES. [2024-06-14 15:42:52,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1926 conditions, 378 events. 193/378 cut-off events. For 4963/4963 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1596 event pairs, 43 based on Foata normal form. 1/377 useless extension candidates. Maximal degree in co-relation 1886. Up to 317 conditions per place. [2024-06-14 15:42:52,321 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 67 selfloop transitions, 12 changer transitions 0/83 dead transitions. [2024-06-14 15:42:52,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 83 transitions, 737 flow [2024-06-14 15:42:52,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:42:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:42:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-14 15:42:52,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4128787878787879 [2024-06-14 15:42:52,325 INFO L175 Difference]: Start difference. First operand has 84 places, 67 transitions, 519 flow. Second operand 8 states and 109 transitions. [2024-06-14 15:42:52,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 83 transitions, 737 flow [2024-06-14 15:42:52,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 83 transitions, 654 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-14 15:42:52,330 INFO L231 Difference]: Finished difference. Result has 82 places, 69 transitions, 495 flow [2024-06-14 15:42:52,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=495, PETRI_PLACES=82, PETRI_TRANSITIONS=69} [2024-06-14 15:42:52,330 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 50 predicate places. [2024-06-14 15:42:52,331 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 69 transitions, 495 flow [2024-06-14 15:42:52,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:52,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:52,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:52,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:42:52,331 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:52,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:52,332 INFO L85 PathProgramCache]: Analyzing trace with hash -197891243, now seen corresponding path program 1 times [2024-06-14 15:42:52,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:52,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073390312] [2024-06-14 15:42:52,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:52,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:58,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:58,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:58,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073390312] [2024-06-14 15:42:58,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073390312] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:58,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:58,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:42:58,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673777757] [2024-06-14 15:42:58,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:58,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:42:58,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:58,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:42:58,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:42:58,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:42:58,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 69 transitions, 495 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:58,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:58,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:42:58,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:59,174 INFO L124 PetriNetUnfolderBase]: 241/465 cut-off events. [2024-06-14 15:42:59,175 INFO L125 PetriNetUnfolderBase]: For 6089/6089 co-relation queries the response was YES. [2024-06-14 15:42:59,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2342 conditions, 465 events. 241/465 cut-off events. For 6089/6089 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2113 event pairs, 40 based on Foata normal form. 2/463 useless extension candidates. Maximal degree in co-relation 2302. Up to 358 conditions per place. [2024-06-14 15:42:59,192 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 76 selfloop transitions, 27 changer transitions 0/107 dead transitions. [2024-06-14 15:42:59,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 107 transitions, 1001 flow [2024-06-14 15:42:59,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:42:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:42:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-14 15:42:59,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-14 15:42:59,195 INFO L175 Difference]: Start difference. First operand has 82 places, 69 transitions, 495 flow. Second operand 10 states and 133 transitions. [2024-06-14 15:42:59,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 107 transitions, 1001 flow [2024-06-14 15:42:59,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 107 transitions, 915 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-14 15:42:59,205 INFO L231 Difference]: Finished difference. Result has 91 places, 92 transitions, 743 flow [2024-06-14 15:42:59,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=743, PETRI_PLACES=91, PETRI_TRANSITIONS=92} [2024-06-14 15:42:59,206 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 59 predicate places. [2024-06-14 15:42:59,206 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 92 transitions, 743 flow [2024-06-14 15:42:59,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:59,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:59,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:59,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:42:59,207 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:59,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:59,207 INFO L85 PathProgramCache]: Analyzing trace with hash 180863589, now seen corresponding path program 2 times [2024-06-14 15:42:59,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:59,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949814472] [2024-06-14 15:42:59,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:59,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:05,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:05,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949814472] [2024-06-14 15:43:05,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949814472] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:05,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:05,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:43:05,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462390491] [2024-06-14 15:43:05,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:05,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:43:05,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:05,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:43:05,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:43:05,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:43:05,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 743 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:05,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:05,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:43:05,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:06,171 INFO L124 PetriNetUnfolderBase]: 247/476 cut-off events. [2024-06-14 15:43:06,171 INFO L125 PetriNetUnfolderBase]: For 6671/6671 co-relation queries the response was YES. [2024-06-14 15:43:06,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2535 conditions, 476 events. 247/476 cut-off events. For 6671/6671 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2158 event pairs, 30 based on Foata normal form. 2/476 useless extension candidates. Maximal degree in co-relation 2489. Up to 391 conditions per place. [2024-06-14 15:43:06,175 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 88 selfloop transitions, 20 changer transitions 0/112 dead transitions. [2024-06-14 15:43:06,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 112 transitions, 1056 flow [2024-06-14 15:43:06,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:43:06,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:43:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-14 15:43:06,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-14 15:43:06,177 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 743 flow. Second operand 10 states and 133 transitions. [2024-06-14 15:43:06,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 112 transitions, 1056 flow [2024-06-14 15:43:06,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1032 flow, removed 11 selfloop flow, removed 1 redundant places. [2024-06-14 15:43:06,186 INFO L231 Difference]: Finished difference. Result has 101 places, 96 transitions, 821 flow [2024-06-14 15:43:06,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=821, PETRI_PLACES=101, PETRI_TRANSITIONS=96} [2024-06-14 15:43:06,186 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 69 predicate places. [2024-06-14 15:43:06,187 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 96 transitions, 821 flow [2024-06-14 15:43:06,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:06,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:06,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:06,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:43:06,187 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:06,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:06,188 INFO L85 PathProgramCache]: Analyzing trace with hash 357335525, now seen corresponding path program 2 times [2024-06-14 15:43:06,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:06,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766800899] [2024-06-14 15:43:06,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:06,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:13,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:13,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766800899] [2024-06-14 15:43:13,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766800899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:13,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:13,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:43:13,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952757613] [2024-06-14 15:43:13,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:13,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:43:13,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:13,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:43:13,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:43:13,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:43:13,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 821 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:13,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:13,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:43:13,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:13,586 INFO L124 PetriNetUnfolderBase]: 250/479 cut-off events. [2024-06-14 15:43:13,586 INFO L125 PetriNetUnfolderBase]: For 7461/7461 co-relation queries the response was YES. [2024-06-14 15:43:13,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2647 conditions, 479 events. 250/479 cut-off events. For 7461/7461 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2172 event pairs, 40 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 2597. Up to 370 conditions per place. [2024-06-14 15:43:13,590 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 71 selfloop transitions, 31 changer transitions 0/106 dead transitions. [2024-06-14 15:43:13,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 106 transitions, 1110 flow [2024-06-14 15:43:13,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:43:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:43:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2024-06-14 15:43:13,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2024-06-14 15:43:13,591 INFO L175 Difference]: Start difference. First operand has 101 places, 96 transitions, 821 flow. Second operand 8 states and 111 transitions. [2024-06-14 15:43:13,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 106 transitions, 1110 flow [2024-06-14 15:43:13,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 106 transitions, 1046 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-14 15:43:13,600 INFO L231 Difference]: Finished difference. Result has 105 places, 98 transitions, 849 flow [2024-06-14 15:43:13,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=849, PETRI_PLACES=105, PETRI_TRANSITIONS=98} [2024-06-14 15:43:13,600 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 73 predicate places. [2024-06-14 15:43:13,600 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 98 transitions, 849 flow [2024-06-14 15:43:13,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:13,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:13,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:13,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:43:13,601 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:13,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:13,607 INFO L85 PathProgramCache]: Analyzing trace with hash 357128135, now seen corresponding path program 3 times [2024-06-14 15:43:13,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:13,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523926185] [2024-06-14 15:43:13,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:13,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:20,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:20,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:20,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523926185] [2024-06-14 15:43:20,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523926185] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:20,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:20,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:43:20,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391540661] [2024-06-14 15:43:20,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:20,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:43:20,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:20,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:43:20,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:43:20,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:43:20,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 98 transitions, 849 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:20,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:20,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:43:20,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:21,054 INFO L124 PetriNetUnfolderBase]: 247/476 cut-off events. [2024-06-14 15:43:21,054 INFO L125 PetriNetUnfolderBase]: For 7768/7768 co-relation queries the response was YES. [2024-06-14 15:43:21,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2616 conditions, 476 events. 247/476 cut-off events. For 7768/7768 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2173 event pairs, 40 based on Foata normal form. 1/471 useless extension candidates. Maximal degree in co-relation 2565. Up to 366 conditions per place. [2024-06-14 15:43:21,058 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 70 selfloop transitions, 31 changer transitions 0/105 dead transitions. [2024-06-14 15:43:21,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 105 transitions, 1067 flow [2024-06-14 15:43:21,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:43:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:43:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-14 15:43:21,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4128787878787879 [2024-06-14 15:43:21,059 INFO L175 Difference]: Start difference. First operand has 105 places, 98 transitions, 849 flow. Second operand 8 states and 109 transitions. [2024-06-14 15:43:21,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 105 transitions, 1067 flow [2024-06-14 15:43:21,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 105 transitions, 981 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-14 15:43:21,067 INFO L231 Difference]: Finished difference. Result has 107 places, 98 transitions, 830 flow [2024-06-14 15:43:21,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=830, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2024-06-14 15:43:21,068 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 75 predicate places. [2024-06-14 15:43:21,068 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 830 flow [2024-06-14 15:43:21,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:21,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:21,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:21,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:43:21,069 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:21,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:21,069 INFO L85 PathProgramCache]: Analyzing trace with hash -830128041, now seen corresponding path program 3 times [2024-06-14 15:43:21,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:21,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487611269] [2024-06-14 15:43:21,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:21,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:27,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:27,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:27,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487611269] [2024-06-14 15:43:27,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487611269] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:27,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:27,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:43:27,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583030530] [2024-06-14 15:43:27,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:27,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:43:27,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:27,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:43:27,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:43:27,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:43:27,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 830 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:27,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:27,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:43:27,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:28,357 INFO L124 PetriNetUnfolderBase]: 271/521 cut-off events. [2024-06-14 15:43:28,357 INFO L125 PetriNetUnfolderBase]: For 9490/9490 co-relation queries the response was YES. [2024-06-14 15:43:28,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2923 conditions, 521 events. 271/521 cut-off events. For 9490/9490 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2411 event pairs, 32 based on Foata normal form. 2/521 useless extension candidates. Maximal degree in co-relation 2871. Up to 311 conditions per place. [2024-06-14 15:43:28,362 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 76 selfloop transitions, 45 changer transitions 0/125 dead transitions. [2024-06-14 15:43:28,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 125 transitions, 1336 flow [2024-06-14 15:43:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:43:28,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:43:28,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2024-06-14 15:43:28,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42727272727272725 [2024-06-14 15:43:28,363 INFO L175 Difference]: Start difference. First operand has 107 places, 98 transitions, 830 flow. Second operand 10 states and 141 transitions. [2024-06-14 15:43:28,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 125 transitions, 1336 flow [2024-06-14 15:43:28,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 125 transitions, 1266 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 15:43:28,376 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 993 flow [2024-06-14 15:43:28,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=993, PETRI_PLACES=111, PETRI_TRANSITIONS=106} [2024-06-14 15:43:28,376 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 79 predicate places. [2024-06-14 15:43:28,376 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 993 flow [2024-06-14 15:43:28,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:28,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:28,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:28,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:43:28,377 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:28,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:28,378 INFO L85 PathProgramCache]: Analyzing trace with hash -571254171, now seen corresponding path program 4 times [2024-06-14 15:43:28,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:28,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738690929] [2024-06-14 15:43:28,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:28,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:35,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:35,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738690929] [2024-06-14 15:43:35,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738690929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:35,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:35,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:43:35,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732452560] [2024-06-14 15:43:35,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:35,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:43:35,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:35,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:43:35,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:43:35,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:43:35,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 993 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:35,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:35,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:43:35,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:35,775 INFO L124 PetriNetUnfolderBase]: 277/530 cut-off events. [2024-06-14 15:43:35,776 INFO L125 PetriNetUnfolderBase]: For 10727/10727 co-relation queries the response was YES. [2024-06-14 15:43:35,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3134 conditions, 530 events. 277/530 cut-off events. For 10727/10727 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2465 event pairs, 52 based on Foata normal form. 2/530 useless extension candidates. Maximal degree in co-relation 3081. Up to 463 conditions per place. [2024-06-14 15:43:35,781 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 98 selfloop transitions, 15 changer transitions 0/117 dead transitions. [2024-06-14 15:43:35,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 117 transitions, 1279 flow [2024-06-14 15:43:35,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:43:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:43:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-14 15:43:35,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3872053872053872 [2024-06-14 15:43:35,783 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 993 flow. Second operand 9 states and 115 transitions. [2024-06-14 15:43:35,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 117 transitions, 1279 flow [2024-06-14 15:43:35,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 117 transitions, 1219 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-14 15:43:35,796 INFO L231 Difference]: Finished difference. Result has 115 places, 108 transitions, 1008 flow [2024-06-14 15:43:35,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=935, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1008, PETRI_PLACES=115, PETRI_TRANSITIONS=108} [2024-06-14 15:43:35,796 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 83 predicate places. [2024-06-14 15:43:35,797 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 108 transitions, 1008 flow [2024-06-14 15:43:35,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:35,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:35,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:35,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:43:35,797 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:35,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:35,799 INFO L85 PathProgramCache]: Analyzing trace with hash 623040741, now seen corresponding path program 5 times [2024-06-14 15:43:35,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:35,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160752581] [2024-06-14 15:43:35,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:35,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:42,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:42,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160752581] [2024-06-14 15:43:42,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160752581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:42,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:42,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:43:42,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143533851] [2024-06-14 15:43:42,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:42,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:43:42,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:42,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:43:42,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:43:42,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:43:42,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 108 transitions, 1008 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:42,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:42,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:43:42,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:43,156 INFO L124 PetriNetUnfolderBase]: 273/525 cut-off events. [2024-06-14 15:43:43,156 INFO L125 PetriNetUnfolderBase]: For 10456/10456 co-relation queries the response was YES. [2024-06-14 15:43:43,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3070 conditions, 525 events. 273/525 cut-off events. For 10456/10456 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2444 event pairs, 37 based on Foata normal form. 2/525 useless extension candidates. Maximal degree in co-relation 3015. Up to 314 conditions per place. [2024-06-14 15:43:43,161 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 67 selfloop transitions, 54 changer transitions 0/125 dead transitions. [2024-06-14 15:43:43,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 125 transitions, 1356 flow [2024-06-14 15:43:43,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:43:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:43:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2024-06-14 15:43:43,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212121212121212 [2024-06-14 15:43:43,162 INFO L175 Difference]: Start difference. First operand has 115 places, 108 transitions, 1008 flow. Second operand 10 states and 139 transitions. [2024-06-14 15:43:43,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 125 transitions, 1356 flow [2024-06-14 15:43:43,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 125 transitions, 1281 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-14 15:43:43,178 INFO L231 Difference]: Finished difference. Result has 118 places, 108 transitions, 1046 flow [2024-06-14 15:43:43,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1046, PETRI_PLACES=118, PETRI_TRANSITIONS=108} [2024-06-14 15:43:43,178 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 86 predicate places. [2024-06-14 15:43:43,178 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 108 transitions, 1046 flow [2024-06-14 15:43:43,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:43,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:43,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:43,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:43:43,179 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:43,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:43,180 INFO L85 PathProgramCache]: Analyzing trace with hash 357343461, now seen corresponding path program 6 times [2024-06-14 15:43:43,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:43,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360836558] [2024-06-14 15:43:43,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:43,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:50,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:50,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360836558] [2024-06-14 15:43:50,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360836558] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:50,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:50,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:43:50,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360133340] [2024-06-14 15:43:50,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:50,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:43:50,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:50,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:43:50,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:43:50,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:43:50,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 108 transitions, 1046 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:50,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:50,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:43:50,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:50,448 INFO L124 PetriNetUnfolderBase]: 269/519 cut-off events. [2024-06-14 15:43:50,449 INFO L125 PetriNetUnfolderBase]: For 10554/10554 co-relation queries the response was YES. [2024-06-14 15:43:50,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3053 conditions, 519 events. 269/519 cut-off events. For 10554/10554 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2429 event pairs, 34 based on Foata normal form. 2/519 useless extension candidates. Maximal degree in co-relation 2997. Up to 311 conditions per place. [2024-06-14 15:43:50,453 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 73 selfloop transitions, 46 changer transitions 0/123 dead transitions. [2024-06-14 15:43:50,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 123 transitions, 1334 flow [2024-06-14 15:43:50,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:43:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:43:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2024-06-14 15:43:50,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-14 15:43:50,455 INFO L175 Difference]: Start difference. First operand has 118 places, 108 transitions, 1046 flow. Second operand 10 states and 140 transitions. [2024-06-14 15:43:50,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 123 transitions, 1334 flow [2024-06-14 15:43:50,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 123 transitions, 1221 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 15:43:50,471 INFO L231 Difference]: Finished difference. Result has 120 places, 108 transitions, 1030 flow [2024-06-14 15:43:50,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1030, PETRI_PLACES=120, PETRI_TRANSITIONS=108} [2024-06-14 15:43:50,471 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 88 predicate places. [2024-06-14 15:43:50,471 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 108 transitions, 1030 flow [2024-06-14 15:43:50,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:50,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:50,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:50,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:43:50,472 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:50,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:50,473 INFO L85 PathProgramCache]: Analyzing trace with hash 623379075, now seen corresponding path program 1 times [2024-06-14 15:43:50,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:50,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709649350] [2024-06-14 15:43:50,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:50,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:43:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:43:58,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:43:58,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709649350] [2024-06-14 15:43:58,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709649350] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:43:58,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:43:58,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:43:58,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080112353] [2024-06-14 15:43:58,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:43:58,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:43:58,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:43:58,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:43:58,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:43:58,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:43:58,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 108 transitions, 1030 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:58,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:43:58,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:43:58,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:43:58,615 INFO L124 PetriNetUnfolderBase]: 266/513 cut-off events. [2024-06-14 15:43:58,615 INFO L125 PetriNetUnfolderBase]: For 10678/10678 co-relation queries the response was YES. [2024-06-14 15:43:58,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2984 conditions, 513 events. 266/513 cut-off events. For 10678/10678 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2381 event pairs, 49 based on Foata normal form. 2/513 useless extension candidates. Maximal degree in co-relation 2927. Up to 443 conditions per place. [2024-06-14 15:43:58,619 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 98 selfloop transitions, 16 changer transitions 0/118 dead transitions. [2024-06-14 15:43:58,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 118 transitions, 1280 flow [2024-06-14 15:43:58,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:43:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:43:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 15:43:58,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-14 15:43:58,621 INFO L175 Difference]: Start difference. First operand has 120 places, 108 transitions, 1030 flow. Second operand 10 states and 124 transitions. [2024-06-14 15:43:58,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 118 transitions, 1280 flow [2024-06-14 15:43:58,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 118 transitions, 1195 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 15:43:58,636 INFO L231 Difference]: Finished difference. Result has 123 places, 108 transitions, 981 flow [2024-06-14 15:43:58,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=945, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=981, PETRI_PLACES=123, PETRI_TRANSITIONS=108} [2024-06-14 15:43:58,637 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 91 predicate places. [2024-06-14 15:43:58,637 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 108 transitions, 981 flow [2024-06-14 15:43:58,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:43:58,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:43:58,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:43:58,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:43:58,638 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:43:58,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:43:58,639 INFO L85 PathProgramCache]: Analyzing trace with hash 756537687, now seen corresponding path program 1 times [2024-06-14 15:43:58,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:43:58,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101652865] [2024-06-14 15:43:58,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:43:58,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:43:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:05,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:05,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101652865] [2024-06-14 15:44:05,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101652865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:05,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:05,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:05,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194720192] [2024-06-14 15:44:05,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:05,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:05,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:05,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:05,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:05,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:44:05,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 108 transitions, 981 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:05,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:05,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:44:05,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:06,092 INFO L124 PetriNetUnfolderBase]: 259/515 cut-off events. [2024-06-14 15:44:06,093 INFO L125 PetriNetUnfolderBase]: For 11137/11137 co-relation queries the response was YES. [2024-06-14 15:44:06,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2907 conditions, 515 events. 259/515 cut-off events. For 11137/11137 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2444 event pairs, 42 based on Foata normal form. 2/515 useless extension candidates. Maximal degree in co-relation 2849. Up to 402 conditions per place. [2024-06-14 15:44:06,097 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 87 selfloop transitions, 18 changer transitions 0/122 dead transitions. [2024-06-14 15:44:06,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 122 transitions, 1252 flow [2024-06-14 15:44:06,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:44:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:44:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-14 15:44:06,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42803030303030304 [2024-06-14 15:44:06,098 INFO L175 Difference]: Start difference. First operand has 123 places, 108 transitions, 981 flow. Second operand 8 states and 113 transitions. [2024-06-14 15:44:06,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 122 transitions, 1252 flow [2024-06-14 15:44:06,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 122 transitions, 1212 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 15:44:06,114 INFO L231 Difference]: Finished difference. Result has 124 places, 112 transitions, 1028 flow [2024-06-14 15:44:06,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1028, PETRI_PLACES=124, PETRI_TRANSITIONS=112} [2024-06-14 15:44:06,115 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 92 predicate places. [2024-06-14 15:44:06,115 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 112 transitions, 1028 flow [2024-06-14 15:44:06,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:06,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:06,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:06,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:44:06,116 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:06,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:06,116 INFO L85 PathProgramCache]: Analyzing trace with hash 475607383, now seen corresponding path program 2 times [2024-06-14 15:44:06,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:06,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138363831] [2024-06-14 15:44:06,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:06,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:12,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:12,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:12,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138363831] [2024-06-14 15:44:12,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138363831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:12,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:12,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:12,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290505075] [2024-06-14 15:44:12,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:12,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:12,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:12,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:12,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:12,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:44:12,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 112 transitions, 1028 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:12,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:12,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:44:12,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:13,101 INFO L124 PetriNetUnfolderBase]: 259/511 cut-off events. [2024-06-14 15:44:13,101 INFO L125 PetriNetUnfolderBase]: For 11752/11752 co-relation queries the response was YES. [2024-06-14 15:44:13,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2962 conditions, 511 events. 259/511 cut-off events. For 11752/11752 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2438 event pairs, 34 based on Foata normal form. 2/508 useless extension candidates. Maximal degree in co-relation 2902. Up to 392 conditions per place. [2024-06-14 15:44:13,105 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 88 selfloop transitions, 21 changer transitions 0/126 dead transitions. [2024-06-14 15:44:13,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 126 transitions, 1292 flow [2024-06-14 15:44:13,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:44:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:44:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2024-06-14 15:44:13,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-14 15:44:13,108 INFO L175 Difference]: Start difference. First operand has 124 places, 112 transitions, 1028 flow. Second operand 8 states and 116 transitions. [2024-06-14 15:44:13,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 126 transitions, 1292 flow [2024-06-14 15:44:13,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 126 transitions, 1253 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-14 15:44:13,127 INFO L231 Difference]: Finished difference. Result has 127 places, 113 transitions, 1050 flow [2024-06-14 15:44:13,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1050, PETRI_PLACES=127, PETRI_TRANSITIONS=113} [2024-06-14 15:44:13,128 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 95 predicate places. [2024-06-14 15:44:13,128 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 113 transitions, 1050 flow [2024-06-14 15:44:13,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:13,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:13,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:13,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:44:13,129 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:13,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:13,129 INFO L85 PathProgramCache]: Analyzing trace with hash 472750423, now seen corresponding path program 3 times [2024-06-14 15:44:13,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:13,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284148176] [2024-06-14 15:44:13,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:13,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:20,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:20,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284148176] [2024-06-14 15:44:20,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284148176] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:20,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:20,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:20,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296620799] [2024-06-14 15:44:20,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:20,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:20,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:20,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:20,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:20,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:44:20,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 113 transitions, 1050 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:20,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:20,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:44:20,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:20,822 INFO L124 PetriNetUnfolderBase]: 263/519 cut-off events. [2024-06-14 15:44:20,823 INFO L125 PetriNetUnfolderBase]: For 12548/12548 co-relation queries the response was YES. [2024-06-14 15:44:20,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 519 events. 263/519 cut-off events. For 12548/12548 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2469 event pairs, 32 based on Foata normal form. 2/516 useless extension candidates. Maximal degree in co-relation 2976. Up to 384 conditions per place. [2024-06-14 15:44:20,827 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 93 selfloop transitions, 18 changer transitions 0/128 dead transitions. [2024-06-14 15:44:20,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 128 transitions, 1322 flow [2024-06-14 15:44:20,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:44:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:44:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2024-06-14 15:44:20,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4356060606060606 [2024-06-14 15:44:20,828 INFO L175 Difference]: Start difference. First operand has 127 places, 113 transitions, 1050 flow. Second operand 8 states and 115 transitions. [2024-06-14 15:44:20,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 128 transitions, 1322 flow [2024-06-14 15:44:20,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 128 transitions, 1273 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 15:44:20,848 INFO L231 Difference]: Finished difference. Result has 129 places, 114 transitions, 1057 flow [2024-06-14 15:44:20,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1057, PETRI_PLACES=129, PETRI_TRANSITIONS=114} [2024-06-14 15:44:20,849 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 97 predicate places. [2024-06-14 15:44:20,849 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 114 transitions, 1057 flow [2024-06-14 15:44:20,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:20,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:20,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:20,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:44:20,850 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:20,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:20,850 INFO L85 PathProgramCache]: Analyzing trace with hash 475612343, now seen corresponding path program 1 times [2024-06-14 15:44:20,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:20,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607263253] [2024-06-14 15:44:20,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:20,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:27,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:27,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607263253] [2024-06-14 15:44:27,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607263253] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:27,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:27,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:44:27,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925188283] [2024-06-14 15:44:27,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:27,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:44:27,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:27,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:44:27,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:44:27,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:44:27,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 114 transitions, 1057 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:27,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:27,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:44:27,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:28,144 INFO L124 PetriNetUnfolderBase]: 273/528 cut-off events. [2024-06-14 15:44:28,144 INFO L125 PetriNetUnfolderBase]: For 12093/12093 co-relation queries the response was YES. [2024-06-14 15:44:28,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3008 conditions, 528 events. 273/528 cut-off events. For 12093/12093 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2482 event pairs, 36 based on Foata normal form. 2/528 useless extension candidates. Maximal degree in co-relation 2946. Up to 433 conditions per place. [2024-06-14 15:44:28,148 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 97 selfloop transitions, 28 changer transitions 0/129 dead transitions. [2024-06-14 15:44:28,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 129 transitions, 1375 flow [2024-06-14 15:44:28,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:44:28,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:44:28,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-14 15:44:28,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2024-06-14 15:44:28,157 INFO L175 Difference]: Start difference. First operand has 129 places, 114 transitions, 1057 flow. Second operand 9 states and 120 transitions. [2024-06-14 15:44:28,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 129 transitions, 1375 flow [2024-06-14 15:44:28,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 129 transitions, 1317 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-14 15:44:28,175 INFO L231 Difference]: Finished difference. Result has 132 places, 116 transitions, 1101 flow [2024-06-14 15:44:28,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1101, PETRI_PLACES=132, PETRI_TRANSITIONS=116} [2024-06-14 15:44:28,175 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 100 predicate places. [2024-06-14 15:44:28,175 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 116 transitions, 1101 flow [2024-06-14 15:44:28,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:28,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:28,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:28,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 15:44:28,176 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:28,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:28,177 INFO L85 PathProgramCache]: Analyzing trace with hash 2026913163, now seen corresponding path program 1 times [2024-06-14 15:44:28,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:28,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936039683] [2024-06-14 15:44:28,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:28,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:35,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:35,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936039683] [2024-06-14 15:44:35,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936039683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:35,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:35,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:44:35,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097803253] [2024-06-14 15:44:35,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:35,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:44:35,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:35,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:44:35,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:44:35,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:44:35,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 116 transitions, 1101 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:35,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:35,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:44:35,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:35,659 INFO L124 PetriNetUnfolderBase]: 276/535 cut-off events. [2024-06-14 15:44:35,659 INFO L125 PetriNetUnfolderBase]: For 12600/12600 co-relation queries the response was YES. [2024-06-14 15:44:35,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3058 conditions, 535 events. 276/535 cut-off events. For 12600/12600 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2504 event pairs, 36 based on Foata normal form. 1/534 useless extension candidates. Maximal degree in co-relation 2995. Up to 445 conditions per place. [2024-06-14 15:44:35,663 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 107 selfloop transitions, 24 changer transitions 0/135 dead transitions. [2024-06-14 15:44:35,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 135 transitions, 1447 flow [2024-06-14 15:44:35,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:44:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:44:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-14 15:44:35,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2024-06-14 15:44:35,664 INFO L175 Difference]: Start difference. First operand has 132 places, 116 transitions, 1101 flow. Second operand 10 states and 128 transitions. [2024-06-14 15:44:35,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 135 transitions, 1447 flow [2024-06-14 15:44:35,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 135 transitions, 1363 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-14 15:44:35,686 INFO L231 Difference]: Finished difference. Result has 137 places, 124 transitions, 1151 flow [2024-06-14 15:44:35,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1151, PETRI_PLACES=137, PETRI_TRANSITIONS=124} [2024-06-14 15:44:35,687 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 105 predicate places. [2024-06-14 15:44:35,687 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 124 transitions, 1151 flow [2024-06-14 15:44:35,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:35,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:35,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:35,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 15:44:35,688 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:35,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:35,688 INFO L85 PathProgramCache]: Analyzing trace with hash 707686665, now seen corresponding path program 4 times [2024-06-14 15:44:35,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:35,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975473760] [2024-06-14 15:44:35,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:35,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:42,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:42,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975473760] [2024-06-14 15:44:42,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975473760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:42,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:42,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:44:42,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128851650] [2024-06-14 15:44:42,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:42,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:44:42,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:42,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:44:42,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:44:42,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:44:42,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 124 transitions, 1151 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:42,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:42,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:44:42,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:42,956 INFO L124 PetriNetUnfolderBase]: 262/517 cut-off events. [2024-06-14 15:44:42,957 INFO L125 PetriNetUnfolderBase]: For 12550/12550 co-relation queries the response was YES. [2024-06-14 15:44:42,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2960 conditions, 517 events. 262/517 cut-off events. For 12550/12550 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2475 event pairs, 35 based on Foata normal form. 2/513 useless extension candidates. Maximal degree in co-relation 2894. Up to 403 conditions per place. [2024-06-14 15:44:42,961 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 95 selfloop transitions, 21 changer transitions 0/133 dead transitions. [2024-06-14 15:44:42,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 133 transitions, 1406 flow [2024-06-14 15:44:42,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:44:42,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:44:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-14 15:44:42,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42803030303030304 [2024-06-14 15:44:42,962 INFO L175 Difference]: Start difference. First operand has 137 places, 124 transitions, 1151 flow. Second operand 8 states and 113 transitions. [2024-06-14 15:44:42,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 133 transitions, 1406 flow [2024-06-14 15:44:42,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 133 transitions, 1357 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-14 15:44:42,985 INFO L231 Difference]: Finished difference. Result has 140 places, 125 transitions, 1158 flow [2024-06-14 15:44:42,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1158, PETRI_PLACES=140, PETRI_TRANSITIONS=125} [2024-06-14 15:44:42,986 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 108 predicate places. [2024-06-14 15:44:42,986 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 125 transitions, 1158 flow [2024-06-14 15:44:42,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:42,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:42,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:42,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 15:44:42,987 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:42,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:42,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1807253609, now seen corresponding path program 2 times [2024-06-14 15:44:42,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:42,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78259143] [2024-06-14 15:44:42,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:42,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:44:49,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:49,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78259143] [2024-06-14 15:44:49,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78259143] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:49,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:49,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:44:49,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741648253] [2024-06-14 15:44:49,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:49,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:44:49,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:49,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:44:49,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:44:50,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:44:50,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 125 transitions, 1158 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:50,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:50,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:44:50,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:50,382 INFO L124 PetriNetUnfolderBase]: 276/547 cut-off events. [2024-06-14 15:44:50,382 INFO L125 PetriNetUnfolderBase]: For 13097/13097 co-relation queries the response was YES. [2024-06-14 15:44:50,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3076 conditions, 547 events. 276/547 cut-off events. For 13097/13097 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2622 event pairs, 26 based on Foata normal form. 1/546 useless extension candidates. Maximal degree in co-relation 3008. Up to 405 conditions per place. [2024-06-14 15:44:50,385 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 109 selfloop transitions, 36 changer transitions 0/149 dead transitions. [2024-06-14 15:44:50,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 149 transitions, 1559 flow [2024-06-14 15:44:50,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:44:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:44:50,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-14 15:44:50,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-14 15:44:50,390 INFO L175 Difference]: Start difference. First operand has 140 places, 125 transitions, 1158 flow. Second operand 11 states and 146 transitions. [2024-06-14 15:44:50,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 149 transitions, 1559 flow [2024-06-14 15:44:50,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 149 transitions, 1487 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-14 15:44:50,417 INFO L231 Difference]: Finished difference. Result has 148 places, 135 transitions, 1263 flow [2024-06-14 15:44:50,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1263, PETRI_PLACES=148, PETRI_TRANSITIONS=135} [2024-06-14 15:44:50,417 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 116 predicate places. [2024-06-14 15:44:50,417 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 135 transitions, 1263 flow [2024-06-14 15:44:50,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:50,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:50,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:50,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 15:44:50,418 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:50,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:50,418 INFO L85 PathProgramCache]: Analyzing trace with hash 2134394775, now seen corresponding path program 3 times [2024-06-14 15:44:50,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:50,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882659281] [2024-06-14 15:44:50,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:50,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:44:57,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-14 15:44:57,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:44:57,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882659281] [2024-06-14 15:44:57,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882659281] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:44:57,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:44:57,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:44:57,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587075594] [2024-06-14 15:44:57,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:44:57,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:44:57,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:44:57,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:44:57,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:44:57,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:44:57,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 135 transitions, 1263 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:57,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:44:57,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:44:57,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:44:57,994 INFO L124 PetriNetUnfolderBase]: 279/542 cut-off events. [2024-06-14 15:44:57,995 INFO L125 PetriNetUnfolderBase]: For 13380/13380 co-relation queries the response was YES. [2024-06-14 15:44:57,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3183 conditions, 542 events. 279/542 cut-off events. For 13380/13380 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2553 event pairs, 31 based on Foata normal form. 1/541 useless extension candidates. Maximal degree in co-relation 3111. Up to 410 conditions per place. [2024-06-14 15:44:57,999 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 106 selfloop transitions, 43 changer transitions 0/153 dead transitions. [2024-06-14 15:44:57,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 153 transitions, 1643 flow [2024-06-14 15:44:57,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:44:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:44:58,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-14 15:44:58,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39669421487603307 [2024-06-14 15:44:58,000 INFO L175 Difference]: Start difference. First operand has 148 places, 135 transitions, 1263 flow. Second operand 11 states and 144 transitions. [2024-06-14 15:44:58,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 153 transitions, 1643 flow [2024-06-14 15:44:58,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 153 transitions, 1575 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-14 15:44:58,024 INFO L231 Difference]: Finished difference. Result has 155 places, 140 transitions, 1344 flow [2024-06-14 15:44:58,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1344, PETRI_PLACES=155, PETRI_TRANSITIONS=140} [2024-06-14 15:44:58,025 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 123 predicate places. [2024-06-14 15:44:58,025 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 140 transitions, 1344 flow [2024-06-14 15:44:58,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:44:58,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:44:58,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:44:58,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 15:44:58,025 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:44:58,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:44:58,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2144514105, now seen corresponding path program 4 times [2024-06-14 15:44:58,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:44:58,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502370992] [2024-06-14 15:44:58,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:44:58,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:44:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:05,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:05,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502370992] [2024-06-14 15:45:05,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502370992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:05,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:05,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:45:05,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983286119] [2024-06-14 15:45:05,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:05,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:45:05,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:05,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:45:05,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:45:06,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:45:06,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 140 transitions, 1344 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:06,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:06,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:45:06,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:06,336 INFO L124 PetriNetUnfolderBase]: 285/557 cut-off events. [2024-06-14 15:45:06,336 INFO L125 PetriNetUnfolderBase]: For 15122/15122 co-relation queries the response was YES. [2024-06-14 15:45:06,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3346 conditions, 557 events. 285/557 cut-off events. For 15122/15122 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2677 event pairs, 39 based on Foata normal form. 2/557 useless extension candidates. Maximal degree in co-relation 3271. Up to 476 conditions per place. [2024-06-14 15:45:06,340 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 130 selfloop transitions, 19 changer transitions 0/153 dead transitions. [2024-06-14 15:45:06,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 153 transitions, 1720 flow [2024-06-14 15:45:06,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:45:06,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:45:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-14 15:45:06,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38484848484848483 [2024-06-14 15:45:06,342 INFO L175 Difference]: Start difference. First operand has 155 places, 140 transitions, 1344 flow. Second operand 10 states and 127 transitions. [2024-06-14 15:45:06,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 153 transitions, 1720 flow [2024-06-14 15:45:06,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 153 transitions, 1634 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 15:45:06,368 INFO L231 Difference]: Finished difference. Result has 158 places, 143 transitions, 1360 flow [2024-06-14 15:45:06,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1261, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1360, PETRI_PLACES=158, PETRI_TRANSITIONS=143} [2024-06-14 15:45:06,369 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 126 predicate places. [2024-06-14 15:45:06,369 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 143 transitions, 1360 flow [2024-06-14 15:45:06,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:06,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:06,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:06,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 15:45:06,370 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:06,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:06,370 INFO L85 PathProgramCache]: Analyzing trace with hash 2144870295, now seen corresponding path program 5 times [2024-06-14 15:45:06,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:06,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621718901] [2024-06-14 15:45:06,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:06,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:14,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:14,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621718901] [2024-06-14 15:45:14,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621718901] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:14,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:14,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:45:14,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410196621] [2024-06-14 15:45:14,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:14,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:45:14,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:14,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:45:14,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:45:14,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:45:14,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 143 transitions, 1360 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:14,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:14,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:45:14,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:14,578 INFO L124 PetriNetUnfolderBase]: 288/558 cut-off events. [2024-06-14 15:45:14,578 INFO L125 PetriNetUnfolderBase]: For 14861/14861 co-relation queries the response was YES. [2024-06-14 15:45:14,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3337 conditions, 558 events. 288/558 cut-off events. For 14861/14861 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2629 event pairs, 47 based on Foata normal form. 1/557 useless extension candidates. Maximal degree in co-relation 3263. Up to 475 conditions per place. [2024-06-14 15:45:14,583 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 129 selfloop transitions, 23 changer transitions 0/156 dead transitions. [2024-06-14 15:45:14,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 156 transitions, 1717 flow [2024-06-14 15:45:14,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:45:14,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:45:14,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-14 15:45:14,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38016528925619836 [2024-06-14 15:45:14,599 INFO L175 Difference]: Start difference. First operand has 158 places, 143 transitions, 1360 flow. Second operand 11 states and 138 transitions. [2024-06-14 15:45:14,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 156 transitions, 1717 flow [2024-06-14 15:45:14,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 156 transitions, 1642 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-14 15:45:14,629 INFO L231 Difference]: Finished difference. Result has 161 places, 145 transitions, 1369 flow [2024-06-14 15:45:14,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1285, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1369, PETRI_PLACES=161, PETRI_TRANSITIONS=145} [2024-06-14 15:45:14,630 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 129 predicate places. [2024-06-14 15:45:14,630 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 145 transitions, 1369 flow [2024-06-14 15:45:14,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:14,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:14,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:14,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 15:45:14,630 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:14,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1849294905, now seen corresponding path program 6 times [2024-06-14 15:45:14,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:14,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312836763] [2024-06-14 15:45:14,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:14,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:21,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:21,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312836763] [2024-06-14 15:45:21,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312836763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:21,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:21,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:45:21,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917093774] [2024-06-14 15:45:21,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:21,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:45:21,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:21,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:45:21,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:45:21,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:45:21,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 145 transitions, 1369 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:21,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:21,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:45:21,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:22,046 INFO L124 PetriNetUnfolderBase]: 286/556 cut-off events. [2024-06-14 15:45:22,046 INFO L125 PetriNetUnfolderBase]: For 14862/14862 co-relation queries the response was YES. [2024-06-14 15:45:22,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3297 conditions, 556 events. 286/556 cut-off events. For 14862/14862 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2640 event pairs, 31 based on Foata normal form. 1/555 useless extension candidates. Maximal degree in co-relation 3222. Up to 422 conditions per place. [2024-06-14 15:45:22,066 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 116 selfloop transitions, 41 changer transitions 0/161 dead transitions. [2024-06-14 15:45:22,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 161 transitions, 1752 flow [2024-06-14 15:45:22,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:45:22,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:45:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-14 15:45:22,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2024-06-14 15:45:22,069 INFO L175 Difference]: Start difference. First operand has 161 places, 145 transitions, 1369 flow. Second operand 11 states and 145 transitions. [2024-06-14 15:45:22,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 161 transitions, 1752 flow [2024-06-14 15:45:22,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 161 transitions, 1698 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 15:45:22,097 INFO L231 Difference]: Finished difference. Result has 164 places, 149 transitions, 1452 flow [2024-06-14 15:45:22,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1452, PETRI_PLACES=164, PETRI_TRANSITIONS=149} [2024-06-14 15:45:22,099 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 132 predicate places. [2024-06-14 15:45:22,099 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 149 transitions, 1452 flow [2024-06-14 15:45:22,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:22,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:22,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:22,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 15:45:22,100 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:22,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:22,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1977980582, now seen corresponding path program 1 times [2024-06-14 15:45:22,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:22,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23085941] [2024-06-14 15:45:22,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:22,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:28,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-14 15:45:28,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:28,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23085941] [2024-06-14 15:45:28,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23085941] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:28,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:28,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:45:28,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585438705] [2024-06-14 15:45:28,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:28,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:45:28,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:28,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:45:28,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:45:29,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:45:29,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 149 transitions, 1452 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:29,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:29,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:45:29,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:29,413 INFO L124 PetriNetUnfolderBase]: 296/580 cut-off events. [2024-06-14 15:45:29,414 INFO L125 PetriNetUnfolderBase]: For 16620/16620 co-relation queries the response was YES. [2024-06-14 15:45:29,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3486 conditions, 580 events. 296/580 cut-off events. For 16620/16620 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2824 event pairs, 29 based on Foata normal form. 2/580 useless extension candidates. Maximal degree in co-relation 3409. Up to 471 conditions per place. [2024-06-14 15:45:29,418 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 134 selfloop transitions, 27 changer transitions 0/165 dead transitions. [2024-06-14 15:45:29,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 165 transitions, 1860 flow [2024-06-14 15:45:29,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:29,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-14 15:45:29,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4006734006734007 [2024-06-14 15:45:29,420 INFO L175 Difference]: Start difference. First operand has 164 places, 149 transitions, 1452 flow. Second operand 9 states and 119 transitions. [2024-06-14 15:45:29,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 165 transitions, 1860 flow [2024-06-14 15:45:29,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 165 transitions, 1740 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-14 15:45:29,452 INFO L231 Difference]: Finished difference. Result has 165 places, 154 transitions, 1453 flow [2024-06-14 15:45:29,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1453, PETRI_PLACES=165, PETRI_TRANSITIONS=154} [2024-06-14 15:45:29,453 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 133 predicate places. [2024-06-14 15:45:29,453 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 154 transitions, 1453 flow [2024-06-14 15:45:29,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:29,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:29,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:29,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 15:45:29,454 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:29,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:29,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1977832712, now seen corresponding path program 2 times [2024-06-14 15:45:29,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:29,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436663299] [2024-06-14 15:45:29,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:29,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:37,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:37,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:37,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436663299] [2024-06-14 15:45:37,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436663299] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:37,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:37,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:45:37,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539542284] [2024-06-14 15:45:37,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:37,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:45:37,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:37,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:45:37,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:45:37,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:45:37,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 154 transitions, 1453 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:37,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:37,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:45:37,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:38,248 INFO L124 PetriNetUnfolderBase]: 307/598 cut-off events. [2024-06-14 15:45:38,248 INFO L125 PetriNetUnfolderBase]: For 18806/18806 co-relation queries the response was YES. [2024-06-14 15:45:38,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3622 conditions, 598 events. 307/598 cut-off events. For 18806/18806 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2903 event pairs, 32 based on Foata normal form. 2/598 useless extension candidates. Maximal degree in co-relation 3544. Up to 435 conditions per place. [2024-06-14 15:45:38,253 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 129 selfloop transitions, 37 changer transitions 0/170 dead transitions. [2024-06-14 15:45:38,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 170 transitions, 1923 flow [2024-06-14 15:45:38,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-14 15:45:38,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-14 15:45:38,281 INFO L175 Difference]: Start difference. First operand has 165 places, 154 transitions, 1453 flow. Second operand 9 states and 123 transitions. [2024-06-14 15:45:38,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 170 transitions, 1923 flow [2024-06-14 15:45:38,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 170 transitions, 1862 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-14 15:45:38,316 INFO L231 Difference]: Finished difference. Result has 168 places, 156 transitions, 1496 flow [2024-06-14 15:45:38,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1496, PETRI_PLACES=168, PETRI_TRANSITIONS=156} [2024-06-14 15:45:38,316 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 136 predicate places. [2024-06-14 15:45:38,317 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 156 transitions, 1496 flow [2024-06-14 15:45:38,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:38,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:38,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:38,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 15:45:38,317 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:38,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:38,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1202526284, now seen corresponding path program 3 times [2024-06-14 15:45:38,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:38,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957598980] [2024-06-14 15:45:38,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:38,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:45,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:45,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:45,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957598980] [2024-06-14 15:45:45,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957598980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:45,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:45,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:45:45,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333789813] [2024-06-14 15:45:45,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:45,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:45:45,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:45,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:45:45,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:45:45,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:45:45,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 156 transitions, 1496 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:45,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:45,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:45:45,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:45,741 INFO L124 PetriNetUnfolderBase]: 304/600 cut-off events. [2024-06-14 15:45:45,742 INFO L125 PetriNetUnfolderBase]: For 18289/18289 co-relation queries the response was YES. [2024-06-14 15:45:45,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3560 conditions, 600 events. 304/600 cut-off events. For 18289/18289 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2952 event pairs, 30 based on Foata normal form. 2/600 useless extension candidates. Maximal degree in co-relation 3482. Up to 487 conditions per place. [2024-06-14 15:45:45,751 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 135 selfloop transitions, 28 changer transitions 0/167 dead transitions. [2024-06-14 15:45:45,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 167 transitions, 1848 flow [2024-06-14 15:45:45,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:45,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-14 15:45:45,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4006734006734007 [2024-06-14 15:45:45,754 INFO L175 Difference]: Start difference. First operand has 168 places, 156 transitions, 1496 flow. Second operand 9 states and 119 transitions. [2024-06-14 15:45:45,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 167 transitions, 1848 flow [2024-06-14 15:45:45,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 167 transitions, 1787 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-14 15:45:45,790 INFO L231 Difference]: Finished difference. Result has 172 places, 156 transitions, 1496 flow [2024-06-14 15:45:45,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1496, PETRI_PLACES=172, PETRI_TRANSITIONS=156} [2024-06-14 15:45:45,791 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 140 predicate places. [2024-06-14 15:45:45,791 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 156 transitions, 1496 flow [2024-06-14 15:45:45,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:45,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:45,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:45,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 15:45:45,792 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:45,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:45,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1500874802, now seen corresponding path program 4 times [2024-06-14 15:45:45,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:45,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575560669] [2024-06-14 15:45:45,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:45,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:45:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:45:53,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:45:53,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575560669] [2024-06-14 15:45:53,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575560669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:45:53,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:45:53,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:45:53,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439989136] [2024-06-14 15:45:53,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:45:53,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:45:53,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:45:53,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:45:53,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:45:53,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:45:53,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 156 transitions, 1496 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:53,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:45:53,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:45:53,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:45:53,975 INFO L124 PetriNetUnfolderBase]: 315/621 cut-off events. [2024-06-14 15:45:53,976 INFO L125 PetriNetUnfolderBase]: For 20818/20818 co-relation queries the response was YES. [2024-06-14 15:45:53,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3770 conditions, 621 events. 315/621 cut-off events. For 20818/20818 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3092 event pairs, 31 based on Foata normal form. 2/621 useless extension candidates. Maximal degree in co-relation 3690. Up to 489 conditions per place. [2024-06-14 15:45:53,981 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 145 selfloop transitions, 25 changer transitions 0/174 dead transitions. [2024-06-14 15:45:53,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 174 transitions, 1988 flow [2024-06-14 15:45:53,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:45:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:45:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-14 15:45:53,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-14 15:45:53,983 INFO L175 Difference]: Start difference. First operand has 172 places, 156 transitions, 1496 flow. Second operand 9 states and 123 transitions. [2024-06-14 15:45:53,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 174 transitions, 1988 flow [2024-06-14 15:45:54,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 174 transitions, 1905 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-14 15:45:54,025 INFO L231 Difference]: Finished difference. Result has 172 places, 158 transitions, 1497 flow [2024-06-14 15:45:54,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1413, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1497, PETRI_PLACES=172, PETRI_TRANSITIONS=158} [2024-06-14 15:45:54,025 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 140 predicate places. [2024-06-14 15:45:54,025 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 158 transitions, 1497 flow [2024-06-14 15:45:54,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:45:54,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:45:54,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:45:54,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 15:45:54,026 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:45:54,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:45:54,027 INFO L85 PathProgramCache]: Analyzing trace with hash 981172548, now seen corresponding path program 5 times [2024-06-14 15:45:54,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:45:54,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552421154] [2024-06-14 15:45:54,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:45:54,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:45:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:01,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:01,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:01,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552421154] [2024-06-14 15:46:01,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552421154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:01,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:01,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:46:01,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111691580] [2024-06-14 15:46:01,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:01,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:46:01,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:01,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:46:01,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:46:01,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:46:01,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 158 transitions, 1497 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:01,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:01,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:46:01,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:01,494 INFO L124 PetriNetUnfolderBase]: 312/610 cut-off events. [2024-06-14 15:46:01,495 INFO L125 PetriNetUnfolderBase]: For 19821/19821 co-relation queries the response was YES. [2024-06-14 15:46:01,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3664 conditions, 610 events. 312/610 cut-off events. For 19821/19821 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3000 event pairs, 33 based on Foata normal form. 2/610 useless extension candidates. Maximal degree in co-relation 3583. Up to 503 conditions per place. [2024-06-14 15:46:01,499 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 143 selfloop transitions, 25 changer transitions 0/172 dead transitions. [2024-06-14 15:46:01,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 172 transitions, 1869 flow [2024-06-14 15:46:01,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:46:01,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:46:01,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-14 15:46:01,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2024-06-14 15:46:01,505 INFO L175 Difference]: Start difference. First operand has 172 places, 158 transitions, 1497 flow. Second operand 9 states and 120 transitions. [2024-06-14 15:46:01,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 172 transitions, 1869 flow [2024-06-14 15:46:01,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 172 transitions, 1814 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-14 15:46:01,539 INFO L231 Difference]: Finished difference. Result has 176 places, 158 transitions, 1497 flow [2024-06-14 15:46:01,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1497, PETRI_PLACES=176, PETRI_TRANSITIONS=158} [2024-06-14 15:46:01,540 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 144 predicate places. [2024-06-14 15:46:01,540 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 158 transitions, 1497 flow [2024-06-14 15:46:01,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:01,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:01,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:01,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 15:46:01,541 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:01,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:01,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1770362120, now seen corresponding path program 6 times [2024-06-14 15:46:01,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:01,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930074450] [2024-06-14 15:46:01,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:01,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:08,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:08,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:08,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930074450] [2024-06-14 15:46:08,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930074450] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:08,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:08,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:46:08,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920092335] [2024-06-14 15:46:08,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:08,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:46:08,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:08,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:46:08,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:46:08,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:46:08,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 158 transitions, 1497 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:08,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:08,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:46:08,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:09,287 INFO L124 PetriNetUnfolderBase]: 316/618 cut-off events. [2024-06-14 15:46:09,287 INFO L125 PetriNetUnfolderBase]: For 20395/20395 co-relation queries the response was YES. [2024-06-14 15:46:09,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3721 conditions, 618 events. 316/618 cut-off events. For 20395/20395 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3043 event pairs, 29 based on Foata normal form. 2/618 useless extension candidates. Maximal degree in co-relation 3638. Up to 493 conditions per place. [2024-06-14 15:46:09,293 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 152 selfloop transitions, 19 changer transitions 0/175 dead transitions. [2024-06-14 15:46:09,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 175 transitions, 1895 flow [2024-06-14 15:46:09,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:46:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:46:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-14 15:46:09,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4006734006734007 [2024-06-14 15:46:09,294 INFO L175 Difference]: Start difference. First operand has 176 places, 158 transitions, 1497 flow. Second operand 9 states and 119 transitions. [2024-06-14 15:46:09,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 175 transitions, 1895 flow [2024-06-14 15:46:09,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 175 transitions, 1842 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-14 15:46:09,343 INFO L231 Difference]: Finished difference. Result has 177 places, 159 transitions, 1504 flow [2024-06-14 15:46:09,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1444, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1504, PETRI_PLACES=177, PETRI_TRANSITIONS=159} [2024-06-14 15:46:09,345 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 145 predicate places. [2024-06-14 15:46:09,345 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 159 transitions, 1504 flow [2024-06-14 15:46:09,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:09,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:09,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:09,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 15:46:09,346 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:09,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:09,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2110050492, now seen corresponding path program 1 times [2024-06-14 15:46:09,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:09,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198634795] [2024-06-14 15:46:09,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:09,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:16,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:16,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198634795] [2024-06-14 15:46:16,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198634795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:16,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:16,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:46:16,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286124758] [2024-06-14 15:46:16,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:16,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:46:16,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:16,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:46:16,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:46:16,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:46:16,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 159 transitions, 1504 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:16,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:16,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:46:16,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:16,734 INFO L124 PetriNetUnfolderBase]: 320/626 cut-off events. [2024-06-14 15:46:16,735 INFO L125 PetriNetUnfolderBase]: For 21428/21428 co-relation queries the response was YES. [2024-06-14 15:46:16,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3782 conditions, 626 events. 320/626 cut-off events. For 21428/21428 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3092 event pairs, 33 based on Foata normal form. 2/626 useless extension candidates. Maximal degree in co-relation 3698. Up to 522 conditions per place. [2024-06-14 15:46:16,740 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 144 selfloop transitions, 25 changer transitions 0/173 dead transitions. [2024-06-14 15:46:16,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 173 transitions, 1888 flow [2024-06-14 15:46:16,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:46:16,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:46:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-14 15:46:16,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38292011019283745 [2024-06-14 15:46:16,744 INFO L175 Difference]: Start difference. First operand has 177 places, 159 transitions, 1504 flow. Second operand 11 states and 139 transitions. [2024-06-14 15:46:16,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 173 transitions, 1888 flow [2024-06-14 15:46:16,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 173 transitions, 1838 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 15:46:16,791 INFO L231 Difference]: Finished difference. Result has 181 places, 160 transitions, 1526 flow [2024-06-14 15:46:16,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1526, PETRI_PLACES=181, PETRI_TRANSITIONS=160} [2024-06-14 15:46:16,792 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-14 15:46:16,792 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 160 transitions, 1526 flow [2024-06-14 15:46:16,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:16,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:16,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:16,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 15:46:16,793 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:16,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:16,793 INFO L85 PathProgramCache]: Analyzing trace with hash -391859854, now seen corresponding path program 7 times [2024-06-14 15:46:16,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:16,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109723931] [2024-06-14 15:46:16,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:16,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:24,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-14 15:46:24,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:24,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109723931] [2024-06-14 15:46:24,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109723931] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:24,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:24,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:46:24,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106470647] [2024-06-14 15:46:24,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:24,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:46:24,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:24,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:46:24,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:46:24,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:46:24,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 160 transitions, 1526 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:24,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:24,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:46:24,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:24,922 INFO L124 PetriNetUnfolderBase]: 324/634 cut-off events. [2024-06-14 15:46:24,923 INFO L125 PetriNetUnfolderBase]: For 22385/22385 co-relation queries the response was YES. [2024-06-14 15:46:24,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3846 conditions, 634 events. 324/634 cut-off events. For 22385/22385 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3170 event pairs, 38 based on Foata normal form. 2/630 useless extension candidates. Maximal degree in co-relation 3761. Up to 502 conditions per place. [2024-06-14 15:46:24,928 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 130 selfloop transitions, 36 changer transitions 0/170 dead transitions. [2024-06-14 15:46:24,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 170 transitions, 1896 flow [2024-06-14 15:46:24,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:46:24,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:46:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-14 15:46:24,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2024-06-14 15:46:24,932 INFO L175 Difference]: Start difference. First operand has 181 places, 160 transitions, 1526 flow. Second operand 9 states and 121 transitions. [2024-06-14 15:46:24,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 170 transitions, 1896 flow [2024-06-14 15:46:24,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 170 transitions, 1834 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-14 15:46:24,977 INFO L231 Difference]: Finished difference. Result has 181 places, 161 transitions, 1560 flow [2024-06-14 15:46:24,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1560, PETRI_PLACES=181, PETRI_TRANSITIONS=161} [2024-06-14 15:46:24,977 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-14 15:46:24,977 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 161 transitions, 1560 flow [2024-06-14 15:46:24,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:24,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:24,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:24,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 15:46:24,978 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:24,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:24,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2085042962, now seen corresponding path program 8 times [2024-06-14 15:46:24,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:24,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694767323] [2024-06-14 15:46:24,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:24,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:32,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:32,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694767323] [2024-06-14 15:46:32,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694767323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:32,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:32,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:46:32,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049732992] [2024-06-14 15:46:32,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:32,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:46:32,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:32,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:46:32,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:46:32,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:46:32,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 161 transitions, 1560 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:32,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:32,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:46:32,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:33,117 INFO L124 PetriNetUnfolderBase]: 328/642 cut-off events. [2024-06-14 15:46:33,117 INFO L125 PetriNetUnfolderBase]: For 23419/23419 co-relation queries the response was YES. [2024-06-14 15:46:33,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3914 conditions, 642 events. 328/642 cut-off events. For 23419/23419 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3221 event pairs, 40 based on Foata normal form. 2/638 useless extension candidates. Maximal degree in co-relation 3828. Up to 510 conditions per place. [2024-06-14 15:46:33,134 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 130 selfloop transitions, 37 changer transitions 0/171 dead transitions. [2024-06-14 15:46:33,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 171 transitions, 1934 flow [2024-06-14 15:46:33,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:46:33,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:46:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-14 15:46:33,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2024-06-14 15:46:33,137 INFO L175 Difference]: Start difference. First operand has 181 places, 161 transitions, 1560 flow. Second operand 9 states and 120 transitions. [2024-06-14 15:46:33,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 171 transitions, 1934 flow [2024-06-14 15:46:33,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 171 transitions, 1848 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:46:33,203 INFO L231 Difference]: Finished difference. Result has 183 places, 162 transitions, 1574 flow [2024-06-14 15:46:33,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1574, PETRI_PLACES=183, PETRI_TRANSITIONS=162} [2024-06-14 15:46:33,204 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 151 predicate places. [2024-06-14 15:46:33,204 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 162 transitions, 1574 flow [2024-06-14 15:46:33,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:33,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:33,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:33,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 15:46:33,204 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:33,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:33,205 INFO L85 PathProgramCache]: Analyzing trace with hash -397370104, now seen corresponding path program 9 times [2024-06-14 15:46:33,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:33,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691082518] [2024-06-14 15:46:33,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:33,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:40,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:40,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691082518] [2024-06-14 15:46:40,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691082518] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:40,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:40,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:46:40,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888817559] [2024-06-14 15:46:40,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:40,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:46:40,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:40,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:46:40,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:46:40,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:46:40,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 162 transitions, 1574 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:40,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:40,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:46:40,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:40,782 INFO L124 PetriNetUnfolderBase]: 332/650 cut-off events. [2024-06-14 15:46:40,783 INFO L125 PetriNetUnfolderBase]: For 24466/24466 co-relation queries the response was YES. [2024-06-14 15:46:40,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3971 conditions, 650 events. 332/650 cut-off events. For 24466/24466 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3268 event pairs, 38 based on Foata normal form. 2/646 useless extension candidates. Maximal degree in co-relation 3884. Up to 489 conditions per place. [2024-06-14 15:46:40,788 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 130 selfloop transitions, 40 changer transitions 0/174 dead transitions. [2024-06-14 15:46:40,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 174 transitions, 2056 flow [2024-06-14 15:46:40,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:46:40,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:46:40,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-14 15:46:40,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107744107744108 [2024-06-14 15:46:40,789 INFO L175 Difference]: Start difference. First operand has 183 places, 162 transitions, 1574 flow. Second operand 9 states and 122 transitions. [2024-06-14 15:46:40,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 174 transitions, 2056 flow [2024-06-14 15:46:40,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 174 transitions, 1966 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-14 15:46:40,840 INFO L231 Difference]: Finished difference. Result has 185 places, 163 transitions, 1590 flow [2024-06-14 15:46:40,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1590, PETRI_PLACES=185, PETRI_TRANSITIONS=163} [2024-06-14 15:46:40,840 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 153 predicate places. [2024-06-14 15:46:40,840 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 163 transitions, 1590 flow [2024-06-14 15:46:40,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:40,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:40,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:40,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 15:46:40,841 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:40,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:40,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1916858796, now seen corresponding path program 10 times [2024-06-14 15:46:40,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:40,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675516302] [2024-06-14 15:46:40,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:40,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:48,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:48,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675516302] [2024-06-14 15:46:48,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675516302] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:48,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:48,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:46:48,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970582322] [2024-06-14 15:46:48,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:48,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:46:48,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:48,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:46:48,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:46:48,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:46:48,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 163 transitions, 1590 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:48,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:48,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:46:48,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:49,102 INFO L124 PetriNetUnfolderBase]: 329/645 cut-off events. [2024-06-14 15:46:49,102 INFO L125 PetriNetUnfolderBase]: For 22905/22905 co-relation queries the response was YES. [2024-06-14 15:46:49,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3846 conditions, 645 events. 329/645 cut-off events. For 22905/22905 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3245 event pairs, 39 based on Foata normal form. 2/641 useless extension candidates. Maximal degree in co-relation 3758. Up to 513 conditions per place. [2024-06-14 15:46:49,107 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 128 selfloop transitions, 40 changer transitions 0/172 dead transitions. [2024-06-14 15:46:49,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 172 transitions, 1946 flow [2024-06-14 15:46:49,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:46:49,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:46:49,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-14 15:46:49,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4006734006734007 [2024-06-14 15:46:49,108 INFO L175 Difference]: Start difference. First operand has 185 places, 163 transitions, 1590 flow. Second operand 9 states and 119 transitions. [2024-06-14 15:46:49,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 172 transitions, 1946 flow [2024-06-14 15:46:49,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 172 transitions, 1809 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-14 15:46:49,161 INFO L231 Difference]: Finished difference. Result has 186 places, 163 transitions, 1537 flow [2024-06-14 15:46:49,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1537, PETRI_PLACES=186, PETRI_TRANSITIONS=163} [2024-06-14 15:46:49,162 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 154 predicate places. [2024-06-14 15:46:49,162 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 163 transitions, 1537 flow [2024-06-14 15:46:49,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:49,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:49,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:49,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 15:46:49,163 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:49,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:49,163 INFO L85 PathProgramCache]: Analyzing trace with hash -190286012, now seen corresponding path program 2 times [2024-06-14 15:46:49,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:49,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291096401] [2024-06-14 15:46:49,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:49,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:46:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:46:56,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:46:56,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291096401] [2024-06-14 15:46:56,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291096401] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:46:56,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:46:56,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:46:56,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699509598] [2024-06-14 15:46:56,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:46:56,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:46:56,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:46:56,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:46:56,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:46:56,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:46:56,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 163 transitions, 1537 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:56,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:46:56,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:46:56,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:46:56,663 INFO L124 PetriNetUnfolderBase]: 333/651 cut-off events. [2024-06-14 15:46:56,664 INFO L125 PetriNetUnfolderBase]: For 23482/23482 co-relation queries the response was YES. [2024-06-14 15:46:56,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3765 conditions, 651 events. 333/651 cut-off events. For 23482/23482 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3272 event pairs, 39 based on Foata normal form. 2/647 useless extension candidates. Maximal degree in co-relation 3678. Up to 509 conditions per place. [2024-06-14 15:46:56,669 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 133 selfloop transitions, 38 changer transitions 0/175 dead transitions. [2024-06-14 15:46:56,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 175 transitions, 1921 flow [2024-06-14 15:46:56,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:46:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:46:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-14 15:46:56,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39669421487603307 [2024-06-14 15:46:56,671 INFO L175 Difference]: Start difference. First operand has 186 places, 163 transitions, 1537 flow. Second operand 11 states and 144 transitions. [2024-06-14 15:46:56,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 175 transitions, 1921 flow [2024-06-14 15:46:56,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 175 transitions, 1732 flow, removed 3 selfloop flow, removed 13 redundant places. [2024-06-14 15:46:56,727 INFO L231 Difference]: Finished difference. Result has 184 places, 164 transitions, 1448 flow [2024-06-14 15:46:56,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1448, PETRI_PLACES=184, PETRI_TRANSITIONS=164} [2024-06-14 15:46:56,728 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 152 predicate places. [2024-06-14 15:46:56,728 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 164 transitions, 1448 flow [2024-06-14 15:46:56,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:46:56,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:46:56,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:46:56,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 15:46:56,729 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:46:56,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:46:56,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1493568226, now seen corresponding path program 3 times [2024-06-14 15:46:56,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:46:56,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662267326] [2024-06-14 15:46:56,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:46:56,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:46:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:03,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:03,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:03,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662267326] [2024-06-14 15:47:03,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662267326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:03,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:03,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:47:03,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882046242] [2024-06-14 15:47:03,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:03,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:47:03,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:03,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:47:03,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:47:03,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:47:03,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 164 transitions, 1448 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:03,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:03,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:47:03,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:04,189 INFO L124 PetriNetUnfolderBase]: 337/665 cut-off events. [2024-06-14 15:47:04,189 INFO L125 PetriNetUnfolderBase]: For 24373/24373 co-relation queries the response was YES. [2024-06-14 15:47:04,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3721 conditions, 665 events. 337/665 cut-off events. For 24373/24373 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3390 event pairs, 39 based on Foata normal form. 2/661 useless extension candidates. Maximal degree in co-relation 3634. Up to 517 conditions per place. [2024-06-14 15:47:04,194 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 132 selfloop transitions, 40 changer transitions 0/176 dead transitions. [2024-06-14 15:47:04,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 176 transitions, 1836 flow [2024-06-14 15:47:04,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:47:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:47:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2024-06-14 15:47:04,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-14 15:47:04,196 INFO L175 Difference]: Start difference. First operand has 184 places, 164 transitions, 1448 flow. Second operand 11 states and 143 transitions. [2024-06-14 15:47:04,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 176 transitions, 1836 flow [2024-06-14 15:47:04,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 176 transitions, 1746 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 15:47:04,250 INFO L231 Difference]: Finished difference. Result has 186 places, 165 transitions, 1464 flow [2024-06-14 15:47:04,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1358, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1464, PETRI_PLACES=186, PETRI_TRANSITIONS=165} [2024-06-14 15:47:04,251 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 154 predicate places. [2024-06-14 15:47:04,251 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 165 transitions, 1464 flow [2024-06-14 15:47:04,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:04,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:04,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:04,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 15:47:04,251 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:04,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:04,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1741729604, now seen corresponding path program 4 times [2024-06-14 15:47:04,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:04,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055548497] [2024-06-14 15:47:04,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:04,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:11,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:11,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055548497] [2024-06-14 15:47:11,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055548497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:11,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:11,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:47:11,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095437089] [2024-06-14 15:47:11,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:11,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:47:11,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:11,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:47:11,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:47:11,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:47:11,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 165 transitions, 1464 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:11,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:11,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:47:11,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:11,809 INFO L124 PetriNetUnfolderBase]: 341/679 cut-off events. [2024-06-14 15:47:11,809 INFO L125 PetriNetUnfolderBase]: For 25364/25364 co-relation queries the response was YES. [2024-06-14 15:47:11,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3784 conditions, 679 events. 341/679 cut-off events. For 25364/25364 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3505 event pairs, 41 based on Foata normal form. 2/675 useless extension candidates. Maximal degree in co-relation 3696. Up to 525 conditions per place. [2024-06-14 15:47:11,815 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 130 selfloop transitions, 43 changer transitions 0/177 dead transitions. [2024-06-14 15:47:11,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 177 transitions, 1856 flow [2024-06-14 15:47:11,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:47:11,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:47:11,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-14 15:47:11,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39118457300275483 [2024-06-14 15:47:11,817 INFO L175 Difference]: Start difference. First operand has 186 places, 165 transitions, 1464 flow. Second operand 11 states and 142 transitions. [2024-06-14 15:47:11,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 177 transitions, 1856 flow [2024-06-14 15:47:11,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 177 transitions, 1760 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-14 15:47:11,872 INFO L231 Difference]: Finished difference. Result has 188 places, 166 transitions, 1482 flow [2024-06-14 15:47:11,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1482, PETRI_PLACES=188, PETRI_TRANSITIONS=166} [2024-06-14 15:47:11,873 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 156 predicate places. [2024-06-14 15:47:11,873 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 166 transitions, 1482 flow [2024-06-14 15:47:11,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:11,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:11,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:11,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 15:47:11,874 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:11,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:11,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2066856674, now seen corresponding path program 5 times [2024-06-14 15:47:11,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:11,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158663453] [2024-06-14 15:47:11,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:11,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:19,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:19,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:19,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158663453] [2024-06-14 15:47:19,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158663453] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:19,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:19,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:47:19,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603643374] [2024-06-14 15:47:19,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:19,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:47:19,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:19,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:47:19,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:47:19,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:47:19,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 166 transitions, 1482 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:19,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:19,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:47:19,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:19,750 INFO L124 PetriNetUnfolderBase]: 345/682 cut-off events. [2024-06-14 15:47:19,751 INFO L125 PetriNetUnfolderBase]: For 26284/26284 co-relation queries the response was YES. [2024-06-14 15:47:19,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3838 conditions, 682 events. 345/682 cut-off events. For 26284/26284 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3479 event pairs, 49 based on Foata normal form. 2/682 useless extension candidates. Maximal degree in co-relation 3749. Up to 570 conditions per place. [2024-06-14 15:47:19,756 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 156 selfloop transitions, 23 changer transitions 0/183 dead transitions. [2024-06-14 15:47:19,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 183 transitions, 2014 flow [2024-06-14 15:47:19,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:47:19,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:47:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2024-06-14 15:47:19,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37626262626262624 [2024-06-14 15:47:19,758 INFO L175 Difference]: Start difference. First operand has 188 places, 166 transitions, 1482 flow. Second operand 12 states and 149 transitions. [2024-06-14 15:47:19,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 183 transitions, 2014 flow [2024-06-14 15:47:19,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 183 transitions, 1908 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-14 15:47:19,827 INFO L231 Difference]: Finished difference. Result has 193 places, 169 transitions, 1478 flow [2024-06-14 15:47:19,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1378, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1478, PETRI_PLACES=193, PETRI_TRANSITIONS=169} [2024-06-14 15:47:19,828 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 161 predicate places. [2024-06-14 15:47:19,828 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 169 transitions, 1478 flow [2024-06-14 15:47:19,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:19,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:19,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:19,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 15:47:19,829 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:19,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:19,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2066470724, now seen corresponding path program 6 times [2024-06-14 15:47:19,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:19,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104301760] [2024-06-14 15:47:19,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:19,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:27,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:27,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:27,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104301760] [2024-06-14 15:47:27,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104301760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:27,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:27,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:47:27,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593657620] [2024-06-14 15:47:27,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:27,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:47:27,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:27,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:47:27,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:47:27,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:47:27,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 169 transitions, 1478 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:27,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:27,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:47:27,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:27,569 INFO L124 PetriNetUnfolderBase]: 349/688 cut-off events. [2024-06-14 15:47:27,570 INFO L125 PetriNetUnfolderBase]: For 27276/27276 co-relation queries the response was YES. [2024-06-14 15:47:27,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3858 conditions, 688 events. 349/688 cut-off events. For 27276/27276 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3499 event pairs, 51 based on Foata normal form. 2/688 useless extension candidates. Maximal degree in co-relation 3766. Up to 597 conditions per place. [2024-06-14 15:47:27,575 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 156 selfloop transitions, 22 changer transitions 0/182 dead transitions. [2024-06-14 15:47:27,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 182 transitions, 1886 flow [2024-06-14 15:47:27,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:47:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:47:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 148 transitions. [2024-06-14 15:47:27,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37373737373737376 [2024-06-14 15:47:27,596 INFO L175 Difference]: Start difference. First operand has 193 places, 169 transitions, 1478 flow. Second operand 12 states and 148 transitions. [2024-06-14 15:47:27,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 182 transitions, 1886 flow [2024-06-14 15:47:27,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 182 transitions, 1789 flow, removed 15 selfloop flow, removed 9 redundant places. [2024-06-14 15:47:27,693 INFO L231 Difference]: Finished difference. Result has 196 places, 170 transitions, 1457 flow [2024-06-14 15:47:27,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1386, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1457, PETRI_PLACES=196, PETRI_TRANSITIONS=170} [2024-06-14 15:47:27,693 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 164 predicate places. [2024-06-14 15:47:27,694 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 170 transitions, 1457 flow [2024-06-14 15:47:27,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:27,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:27,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:27,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 15:47:27,694 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:27,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:27,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2055428834, now seen corresponding path program 7 times [2024-06-14 15:47:27,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:27,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880064912] [2024-06-14 15:47:27,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:27,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:35,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:35,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:35,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880064912] [2024-06-14 15:47:35,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880064912] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:35,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:35,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:47:35,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791173243] [2024-06-14 15:47:35,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:35,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:47:35,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:35,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:47:35,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:47:35,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:47:35,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 170 transitions, 1457 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:35,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:35,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:47:35,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:36,084 INFO L124 PetriNetUnfolderBase]: 358/711 cut-off events. [2024-06-14 15:47:36,084 INFO L125 PetriNetUnfolderBase]: For 36655/36655 co-relation queries the response was YES. [2024-06-14 15:47:36,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3729 conditions, 711 events. 358/711 cut-off events. For 36655/36655 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3656 event pairs, 54 based on Foata normal form. 10/719 useless extension candidates. Maximal degree in co-relation 3638. Up to 588 conditions per place. [2024-06-14 15:47:36,090 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 156 selfloop transitions, 18 changer transitions 6/184 dead transitions. [2024-06-14 15:47:36,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 184 transitions, 1887 flow [2024-06-14 15:47:36,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:47:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:47:36,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-06-14 15:47:36,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3884297520661157 [2024-06-14 15:47:36,091 INFO L175 Difference]: Start difference. First operand has 196 places, 170 transitions, 1457 flow. Second operand 11 states and 141 transitions. [2024-06-14 15:47:36,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 184 transitions, 1887 flow [2024-06-14 15:47:36,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 184 transitions, 1798 flow, removed 20 selfloop flow, removed 10 redundant places. [2024-06-14 15:47:36,145 INFO L231 Difference]: Finished difference. Result has 197 places, 167 transitions, 1386 flow [2024-06-14 15:47:36,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1386, PETRI_PLACES=197, PETRI_TRANSITIONS=167} [2024-06-14 15:47:36,145 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 165 predicate places. [2024-06-14 15:47:36,145 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 167 transitions, 1386 flow [2024-06-14 15:47:36,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:36,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:36,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:36,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 15:47:36,146 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:36,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:36,147 INFO L85 PathProgramCache]: Analyzing trace with hash 699705312, now seen corresponding path program 1 times [2024-06-14 15:47:36,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:36,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542514390] [2024-06-14 15:47:36,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:36,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:43,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:43,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:43,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542514390] [2024-06-14 15:47:43,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542514390] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:43,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:43,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:47:43,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528270221] [2024-06-14 15:47:43,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:43,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:47:43,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:43,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:47:43,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:47:43,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:47:43,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 167 transitions, 1386 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:43,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:43,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:47:43,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:43,730 INFO L124 PetriNetUnfolderBase]: 353/697 cut-off events. [2024-06-14 15:47:43,731 INFO L125 PetriNetUnfolderBase]: For 23939/23939 co-relation queries the response was YES. [2024-06-14 15:47:43,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3599 conditions, 697 events. 353/697 cut-off events. For 23939/23939 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3578 event pairs, 35 based on Foata normal form. 1/696 useless extension candidates. Maximal degree in co-relation 3507. Up to 596 conditions per place. [2024-06-14 15:47:43,736 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 162 selfloop transitions, 25 changer transitions 0/191 dead transitions. [2024-06-14 15:47:43,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 191 transitions, 1887 flow [2024-06-14 15:47:43,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:47:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:47:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2024-06-14 15:47:43,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-14 15:47:43,738 INFO L175 Difference]: Start difference. First operand has 197 places, 167 transitions, 1386 flow. Second operand 11 states and 143 transitions. [2024-06-14 15:47:43,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 191 transitions, 1887 flow [2024-06-14 15:47:43,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 191 transitions, 1832 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-06-14 15:47:43,795 INFO L231 Difference]: Finished difference. Result has 200 places, 177 transitions, 1512 flow [2024-06-14 15:47:43,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1331, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1512, PETRI_PLACES=200, PETRI_TRANSITIONS=177} [2024-06-14 15:47:43,796 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 168 predicate places. [2024-06-14 15:47:43,796 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 177 transitions, 1512 flow [2024-06-14 15:47:43,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:43,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:43,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:43,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 15:47:43,796 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:43,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:43,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1259079390, now seen corresponding path program 2 times [2024-06-14 15:47:43,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:43,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59326050] [2024-06-14 15:47:43,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:43,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:51,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:51,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59326050] [2024-06-14 15:47:51,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59326050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:51,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:51,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:47:51,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350380796] [2024-06-14 15:47:51,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:51,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:47:51,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:51,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:47:51,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:47:51,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:47:51,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 177 transitions, 1512 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:51,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:47:51,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:47:51,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:47:52,242 INFO L124 PetriNetUnfolderBase]: 354/701 cut-off events. [2024-06-14 15:47:52,242 INFO L125 PetriNetUnfolderBase]: For 24926/24926 co-relation queries the response was YES. [2024-06-14 15:47:52,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3643 conditions, 701 events. 354/701 cut-off events. For 24926/24926 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3626 event pairs, 35 based on Foata normal form. 2/701 useless extension candidates. Maximal degree in co-relation 3547. Up to 595 conditions per place. [2024-06-14 15:47:52,248 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 165 selfloop transitions, 26 changer transitions 0/195 dead transitions. [2024-06-14 15:47:52,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 195 transitions, 1990 flow [2024-06-14 15:47:52,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:47:52,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:47:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-14 15:47:52,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39669421487603307 [2024-06-14 15:47:52,249 INFO L175 Difference]: Start difference. First operand has 200 places, 177 transitions, 1512 flow. Second operand 11 states and 144 transitions. [2024-06-14 15:47:52,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 195 transitions, 1990 flow [2024-06-14 15:47:52,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 195 transitions, 1923 flow, removed 23 selfloop flow, removed 3 redundant places. [2024-06-14 15:47:52,304 INFO L231 Difference]: Finished difference. Result has 208 places, 179 transitions, 1552 flow [2024-06-14 15:47:52,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1445, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1552, PETRI_PLACES=208, PETRI_TRANSITIONS=179} [2024-06-14 15:47:52,304 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 176 predicate places. [2024-06-14 15:47:52,305 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 179 transitions, 1552 flow [2024-06-14 15:47:52,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:47:52,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:47:52,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:47:52,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 15:47:52,305 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:47:52,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:47:52,306 INFO L85 PathProgramCache]: Analyzing trace with hash -349384776, now seen corresponding path program 1 times [2024-06-14 15:47:52,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:47:52,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903458771] [2024-06-14 15:47:52,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:47:52,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:47:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:47:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:47:59,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:47:59,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903458771] [2024-06-14 15:47:59,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903458771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:47:59,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:47:59,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:47:59,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631998352] [2024-06-14 15:47:59,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:47:59,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:47:59,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:47:59,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:47:59,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:00,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:48:00,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 179 transitions, 1552 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:00,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:00,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:48:00,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:00,525 INFO L124 PetriNetUnfolderBase]: 364/721 cut-off events. [2024-06-14 15:48:00,525 INFO L125 PetriNetUnfolderBase]: For 25996/25996 co-relation queries the response was YES. [2024-06-14 15:48:00,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3751 conditions, 721 events. 364/721 cut-off events. For 25996/25996 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3768 event pairs, 38 based on Foata normal form. 2/721 useless extension candidates. Maximal degree in co-relation 3654. Up to 584 conditions per place. [2024-06-14 15:48:00,532 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 158 selfloop transitions, 34 changer transitions 0/196 dead transitions. [2024-06-14 15:48:00,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 196 transitions, 2019 flow [2024-06-14 15:48:00,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-14 15:48:00,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:48:00,533 INFO L175 Difference]: Start difference. First operand has 208 places, 179 transitions, 1552 flow. Second operand 10 states and 132 transitions. [2024-06-14 15:48:00,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 196 transitions, 2019 flow [2024-06-14 15:48:00,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 196 transitions, 1883 flow, removed 33 selfloop flow, removed 11 redundant places. [2024-06-14 15:48:00,608 INFO L231 Difference]: Finished difference. Result has 207 places, 184 transitions, 1546 flow [2024-06-14 15:48:00,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1416, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1546, PETRI_PLACES=207, PETRI_TRANSITIONS=184} [2024-06-14 15:48:00,608 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 175 predicate places. [2024-06-14 15:48:00,608 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 184 transitions, 1546 flow [2024-06-14 15:48:00,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:00,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:00,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:00,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 15:48:00,609 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:00,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:00,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1187856824, now seen corresponding path program 2 times [2024-06-14 15:48:00,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:00,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504765493] [2024-06-14 15:48:00,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:00,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:08,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:08,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:08,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504765493] [2024-06-14 15:48:08,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504765493] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:08,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:08,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:08,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771003468] [2024-06-14 15:48:08,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:08,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:08,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:08,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:08,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:08,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:48:08,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 184 transitions, 1546 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:08,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:08,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:48:08,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:08,539 INFO L124 PetriNetUnfolderBase]: 368/729 cut-off events. [2024-06-14 15:48:08,539 INFO L125 PetriNetUnfolderBase]: For 26310/26310 co-relation queries the response was YES. [2024-06-14 15:48:08,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3709 conditions, 729 events. 368/729 cut-off events. For 26310/26310 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3821 event pairs, 38 based on Foata normal form. 2/729 useless extension candidates. Maximal degree in co-relation 3616. Up to 576 conditions per place. [2024-06-14 15:48:08,545 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 160 selfloop transitions, 34 changer transitions 0/198 dead transitions. [2024-06-14 15:48:08,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 198 transitions, 1976 flow [2024-06-14 15:48:08,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:08,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:08,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-14 15:48:08,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2024-06-14 15:48:08,546 INFO L175 Difference]: Start difference. First operand has 207 places, 184 transitions, 1546 flow. Second operand 10 states and 134 transitions. [2024-06-14 15:48:08,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 198 transitions, 1976 flow [2024-06-14 15:48:08,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 198 transitions, 1909 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:48:08,603 INFO L231 Difference]: Finished difference. Result has 210 places, 185 transitions, 1565 flow [2024-06-14 15:48:08,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1479, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1565, PETRI_PLACES=210, PETRI_TRANSITIONS=185} [2024-06-14 15:48:08,603 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 178 predicate places. [2024-06-14 15:48:08,603 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 185 transitions, 1565 flow [2024-06-14 15:48:08,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:08,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:08,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:08,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 15:48:08,604 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:08,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:08,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1183272854, now seen corresponding path program 3 times [2024-06-14 15:48:08,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:08,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879889888] [2024-06-14 15:48:08,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:08,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:16,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:16,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879889888] [2024-06-14 15:48:16,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879889888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:16,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:16,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:16,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077715817] [2024-06-14 15:48:16,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:16,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:16,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:16,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:16,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:16,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:48:16,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 185 transitions, 1565 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:16,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:16,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:48:16,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:16,644 INFO L124 PetriNetUnfolderBase]: 379/749 cut-off events. [2024-06-14 15:48:16,645 INFO L125 PetriNetUnfolderBase]: For 30916/30916 co-relation queries the response was YES. [2024-06-14 15:48:16,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3945 conditions, 749 events. 379/749 cut-off events. For 30916/30916 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3939 event pairs, 36 based on Foata normal form. 2/749 useless extension candidates. Maximal degree in co-relation 3852. Up to 507 conditions per place. [2024-06-14 15:48:16,651 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 147 selfloop transitions, 51 changer transitions 0/202 dead transitions. [2024-06-14 15:48:16,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 202 transitions, 2143 flow [2024-06-14 15:48:16,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-14 15:48:16,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-14 15:48:16,653 INFO L175 Difference]: Start difference. First operand has 210 places, 185 transitions, 1565 flow. Second operand 10 states and 137 transitions. [2024-06-14 15:48:16,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 202 transitions, 2143 flow [2024-06-14 15:48:16,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 202 transitions, 2067 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 15:48:16,724 INFO L231 Difference]: Finished difference. Result has 212 places, 187 transitions, 1625 flow [2024-06-14 15:48:16,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1625, PETRI_PLACES=212, PETRI_TRANSITIONS=187} [2024-06-14 15:48:16,725 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 180 predicate places. [2024-06-14 15:48:16,725 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 187 transitions, 1625 flow [2024-06-14 15:48:16,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:16,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:16,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:16,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 15:48:16,726 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:16,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:16,727 INFO L85 PathProgramCache]: Analyzing trace with hash -995643498, now seen corresponding path program 4 times [2024-06-14 15:48:16,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:16,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871258487] [2024-06-14 15:48:16,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:16,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:23,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:23,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:23,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871258487] [2024-06-14 15:48:23,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871258487] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:23,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:23,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:23,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190537886] [2024-06-14 15:48:23,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:23,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:23,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:23,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:23,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:24,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:48:24,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 187 transitions, 1625 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:24,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:24,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:48:24,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:24,442 INFO L124 PetriNetUnfolderBase]: 389/769 cut-off events. [2024-06-14 15:48:24,442 INFO L125 PetriNetUnfolderBase]: For 32391/32391 co-relation queries the response was YES. [2024-06-14 15:48:24,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4106 conditions, 769 events. 389/769 cut-off events. For 32391/32391 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4072 event pairs, 40 based on Foata normal form. 2/769 useless extension candidates. Maximal degree in co-relation 4012. Up to 586 conditions per place. [2024-06-14 15:48:24,448 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 136 selfloop transitions, 64 changer transitions 0/204 dead transitions. [2024-06-14 15:48:24,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 204 transitions, 2122 flow [2024-06-14 15:48:24,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-14 15:48:24,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-14 15:48:24,450 INFO L175 Difference]: Start difference. First operand has 212 places, 187 transitions, 1625 flow. Second operand 10 states and 132 transitions. [2024-06-14 15:48:24,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 204 transitions, 2122 flow [2024-06-14 15:48:24,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 204 transitions, 2025 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 15:48:24,524 INFO L231 Difference]: Finished difference. Result has 215 places, 192 transitions, 1732 flow [2024-06-14 15:48:24,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1538, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1732, PETRI_PLACES=215, PETRI_TRANSITIONS=192} [2024-06-14 15:48:24,525 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 183 predicate places. [2024-06-14 15:48:24,525 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 192 transitions, 1732 flow [2024-06-14 15:48:24,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:24,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:24,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:24,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 15:48:24,525 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:24,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:24,526 INFO L85 PathProgramCache]: Analyzing trace with hash 2006907308, now seen corresponding path program 5 times [2024-06-14 15:48:24,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:24,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347091774] [2024-06-14 15:48:24,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:24,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:30,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:30,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:30,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347091774] [2024-06-14 15:48:30,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347091774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:30,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:30,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:48:30,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654908715] [2024-06-14 15:48:30,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:30,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:48:30,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:30,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:48:30,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:48:31,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:48:31,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 192 transitions, 1732 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:31,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:31,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:48:31,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:31,449 INFO L124 PetriNetUnfolderBase]: 393/778 cut-off events. [2024-06-14 15:48:31,449 INFO L125 PetriNetUnfolderBase]: For 33301/33301 co-relation queries the response was YES. [2024-06-14 15:48:31,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4206 conditions, 778 events. 393/778 cut-off events. For 33301/33301 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4146 event pairs, 43 based on Foata normal form. 2/778 useless extension candidates. Maximal degree in co-relation 4111. Up to 637 conditions per place. [2024-06-14 15:48:31,455 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 162 selfloop transitions, 39 changer transitions 0/205 dead transitions. [2024-06-14 15:48:31,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 205 transitions, 2176 flow [2024-06-14 15:48:31,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:31,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:31,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2024-06-14 15:48:31,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4303030303030303 [2024-06-14 15:48:31,456 INFO L175 Difference]: Start difference. First operand has 215 places, 192 transitions, 1732 flow. Second operand 10 states and 142 transitions. [2024-06-14 15:48:31,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 205 transitions, 2176 flow [2024-06-14 15:48:31,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 205 transitions, 2074 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 15:48:31,537 INFO L231 Difference]: Finished difference. Result has 219 places, 193 transitions, 1729 flow [2024-06-14 15:48:31,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1729, PETRI_PLACES=219, PETRI_TRANSITIONS=193} [2024-06-14 15:48:31,537 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 187 predicate places. [2024-06-14 15:48:31,538 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 193 transitions, 1729 flow [2024-06-14 15:48:31,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:31,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:31,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:31,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 15:48:31,538 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:31,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:31,539 INFO L85 PathProgramCache]: Analyzing trace with hash -340762628, now seen corresponding path program 6 times [2024-06-14 15:48:31,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:31,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585196150] [2024-06-14 15:48:31,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:31,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:38,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:38,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585196150] [2024-06-14 15:48:38,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585196150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:38,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:38,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:38,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841566452] [2024-06-14 15:48:38,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:38,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:38,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:38,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:38,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:38,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:48:38,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 193 transitions, 1729 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:38,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:38,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:48:38,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:38,982 INFO L124 PetriNetUnfolderBase]: 390/773 cut-off events. [2024-06-14 15:48:38,982 INFO L125 PetriNetUnfolderBase]: For 30317/30317 co-relation queries the response was YES. [2024-06-14 15:48:38,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4043 conditions, 773 events. 390/773 cut-off events. For 30317/30317 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4128 event pairs, 42 based on Foata normal form. 2/773 useless extension candidates. Maximal degree in co-relation 3947. Up to 608 conditions per place. [2024-06-14 15:48:38,988 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 162 selfloop transitions, 40 changer transitions 0/206 dead transitions. [2024-06-14 15:48:38,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 206 transitions, 2163 flow [2024-06-14 15:48:38,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-14 15:48:38,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-14 15:48:38,990 INFO L175 Difference]: Start difference. First operand has 219 places, 193 transitions, 1729 flow. Second operand 10 states and 133 transitions. [2024-06-14 15:48:38,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 206 transitions, 2163 flow [2024-06-14 15:48:39,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 206 transitions, 2017 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-14 15:48:39,070 INFO L231 Difference]: Finished difference. Result has 219 places, 193 transitions, 1667 flow [2024-06-14 15:48:39,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1583, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1667, PETRI_PLACES=219, PETRI_TRANSITIONS=193} [2024-06-14 15:48:39,070 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 187 predicate places. [2024-06-14 15:48:39,071 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 193 transitions, 1667 flow [2024-06-14 15:48:39,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:39,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:39,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:39,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 15:48:39,071 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:39,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:39,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1792190358, now seen corresponding path program 7 times [2024-06-14 15:48:39,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:39,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815954414] [2024-06-14 15:48:39,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:39,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:48:47,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:47,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815954414] [2024-06-14 15:48:47,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815954414] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:47,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:47,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:47,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282144298] [2024-06-14 15:48:47,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:47,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:47,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:47,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:47,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:47,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:48:47,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 193 transitions, 1667 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:47,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:47,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:48:47,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:48,098 INFO L124 PetriNetUnfolderBase]: 401/794 cut-off events. [2024-06-14 15:48:48,099 INFO L125 PetriNetUnfolderBase]: For 35170/35170 co-relation queries the response was YES. [2024-06-14 15:48:48,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4237 conditions, 794 events. 401/794 cut-off events. For 35170/35170 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4255 event pairs, 41 based on Foata normal form. 2/794 useless extension candidates. Maximal degree in co-relation 4140. Up to 619 conditions per place. [2024-06-14 15:48:48,106 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 175 selfloop transitions, 33 changer transitions 0/212 dead transitions. [2024-06-14 15:48:48,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 212 transitions, 2279 flow [2024-06-14 15:48:48,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:48,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-14 15:48:48,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-06-14 15:48:48,107 INFO L175 Difference]: Start difference. First operand has 219 places, 193 transitions, 1667 flow. Second operand 10 states and 136 transitions. [2024-06-14 15:48:48,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 212 transitions, 2279 flow [2024-06-14 15:48:48,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 212 transitions, 2175 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-14 15:48:48,197 INFO L231 Difference]: Finished difference. Result has 220 places, 195 transitions, 1663 flow [2024-06-14 15:48:48,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1563, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1663, PETRI_PLACES=220, PETRI_TRANSITIONS=195} [2024-06-14 15:48:48,198 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 188 predicate places. [2024-06-14 15:48:48,198 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 195 transitions, 1663 flow [2024-06-14 15:48:48,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:48,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:48,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:48,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 15:48:48,198 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:48,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:48,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1796951958, now seen corresponding path program 8 times [2024-06-14 15:48:48,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:48,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87824959] [2024-06-14 15:48:48,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:48,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:48:56,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-14 15:48:56,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:48:56,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87824959] [2024-06-14 15:48:56,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87824959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:48:56,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:48:56,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:48:56,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132414269] [2024-06-14 15:48:56,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:48:56,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:48:56,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:48:56,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:48:56,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:48:56,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:48:56,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 195 transitions, 1663 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:56,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:48:56,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:48:56,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:48:56,569 INFO L124 PetriNetUnfolderBase]: 405/802 cut-off events. [2024-06-14 15:48:56,569 INFO L125 PetriNetUnfolderBase]: For 36243/36243 co-relation queries the response was YES. [2024-06-14 15:48:56,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4258 conditions, 802 events. 405/802 cut-off events. For 36243/36243 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4306 event pairs, 47 based on Foata normal form. 2/802 useless extension candidates. Maximal degree in co-relation 4160. Up to 670 conditions per place. [2024-06-14 15:48:56,576 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 170 selfloop transitions, 36 changer transitions 0/210 dead transitions. [2024-06-14 15:48:56,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 210 transitions, 2125 flow [2024-06-14 15:48:56,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:48:56,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:48:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-14 15:48:56,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396969696969697 [2024-06-14 15:48:56,577 INFO L175 Difference]: Start difference. First operand has 220 places, 195 transitions, 1663 flow. Second operand 10 states and 131 transitions. [2024-06-14 15:48:56,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 210 transitions, 2125 flow [2024-06-14 15:48:56,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 210 transitions, 2065 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 15:48:56,660 INFO L231 Difference]: Finished difference. Result has 224 places, 196 transitions, 1699 flow [2024-06-14 15:48:56,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1607, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1699, PETRI_PLACES=224, PETRI_TRANSITIONS=196} [2024-06-14 15:48:56,660 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 192 predicate places. [2024-06-14 15:48:56,660 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 196 transitions, 1699 flow [2024-06-14 15:48:56,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:48:56,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:48:56,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:48:56,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 15:48:56,661 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:48:56,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:48:56,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1792305678, now seen corresponding path program 9 times [2024-06-14 15:48:56,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:48:56,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63318339] [2024-06-14 15:48:56,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:48:56,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:48:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:04,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:04,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63318339] [2024-06-14 15:49:04,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63318339] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:04,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:04,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:49:04,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851953317] [2024-06-14 15:49:04,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:04,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:49:04,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:04,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:49:04,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:04,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:49:04,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 196 transitions, 1699 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:04,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:04,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:49:04,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:04,875 INFO L124 PetriNetUnfolderBase]: 402/797 cut-off events. [2024-06-14 15:49:04,876 INFO L125 PetriNetUnfolderBase]: For 32833/32833 co-relation queries the response was YES. [2024-06-14 15:49:04,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4140 conditions, 797 events. 402/797 cut-off events. For 32833/32833 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4292 event pairs, 44 based on Foata normal form. 2/797 useless extension candidates. Maximal degree in co-relation 4040. Up to 647 conditions per place. [2024-06-14 15:49:04,882 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 172 selfloop transitions, 35 changer transitions 0/211 dead transitions. [2024-06-14 15:49:04,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 211 transitions, 2149 flow [2024-06-14 15:49:04,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-14 15:49:04,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-14 15:49:04,883 INFO L175 Difference]: Start difference. First operand has 224 places, 196 transitions, 1699 flow. Second operand 10 states and 133 transitions. [2024-06-14 15:49:04,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 211 transitions, 2149 flow [2024-06-14 15:49:04,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 211 transitions, 2065 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 15:49:04,967 INFO L231 Difference]: Finished difference. Result has 226 places, 196 transitions, 1689 flow [2024-06-14 15:49:04,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1615, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1689, PETRI_PLACES=226, PETRI_TRANSITIONS=196} [2024-06-14 15:49:04,968 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 194 predicate places. [2024-06-14 15:49:04,968 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 196 transitions, 1689 flow [2024-06-14 15:49:04,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:04,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:04,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:04,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 15:49:04,969 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:04,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:04,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1646765862, now seen corresponding path program 10 times [2024-06-14 15:49:04,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:04,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144022745] [2024-06-14 15:49:04,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:04,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:12,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:12,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:12,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144022745] [2024-06-14 15:49:12,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144022745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:12,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:12,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:49:12,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639820887] [2024-06-14 15:49:12,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:12,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:49:12,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:12,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:49:12,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:49:12,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:49:12,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 196 transitions, 1689 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:12,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:12,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:49:12,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:12,997 INFO L124 PetriNetUnfolderBase]: 406/805 cut-off events. [2024-06-14 15:49:12,997 INFO L125 PetriNetUnfolderBase]: For 33896/33896 co-relation queries the response was YES. [2024-06-14 15:49:13,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4178 conditions, 805 events. 406/805 cut-off events. For 33896/33896 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4349 event pairs, 43 based on Foata normal form. 2/805 useless extension candidates. Maximal degree in co-relation 4077. Up to 662 conditions per place. [2024-06-14 15:49:13,005 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 189 selfloop transitions, 21 changer transitions 0/214 dead transitions. [2024-06-14 15:49:13,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 214 transitions, 2165 flow [2024-06-14 15:49:13,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:49:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:49:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-14 15:49:13,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-14 15:49:13,006 INFO L175 Difference]: Start difference. First operand has 226 places, 196 transitions, 1689 flow. Second operand 10 states and 130 transitions. [2024-06-14 15:49:13,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 214 transitions, 2165 flow [2024-06-14 15:49:13,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 214 transitions, 2083 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-14 15:49:13,097 INFO L231 Difference]: Finished difference. Result has 227 places, 197 transitions, 1671 flow [2024-06-14 15:49:13,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1607, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1671, PETRI_PLACES=227, PETRI_TRANSITIONS=197} [2024-06-14 15:49:13,098 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 195 predicate places. [2024-06-14 15:49:13,098 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 197 transitions, 1671 flow [2024-06-14 15:49:13,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:13,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:13,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:13,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 15:49:13,099 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:13,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:13,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1188041398, now seen corresponding path program 1 times [2024-06-14 15:49:13,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:13,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212223185] [2024-06-14 15:49:13,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:13,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:20,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:20,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:20,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212223185] [2024-06-14 15:49:20,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212223185] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:20,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:20,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:49:20,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642390668] [2024-06-14 15:49:20,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:20,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:49:20,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:20,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:49:20,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:49:21,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:49:21,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 197 transitions, 1671 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:21,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:21,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:49:21,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:21,730 INFO L124 PetriNetUnfolderBase]: 415/819 cut-off events. [2024-06-14 15:49:21,731 INFO L125 PetriNetUnfolderBase]: For 32935/32935 co-relation queries the response was YES. [2024-06-14 15:49:21,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4265 conditions, 819 events. 415/819 cut-off events. For 32935/32935 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4440 event pairs, 46 based on Foata normal form. 1/818 useless extension candidates. Maximal degree in co-relation 4163. Up to 604 conditions per place. [2024-06-14 15:49:21,736 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 150 selfloop transitions, 63 changer transitions 0/217 dead transitions. [2024-06-14 15:49:21,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 217 transitions, 2239 flow [2024-06-14 15:49:21,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:49:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:49:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-14 15:49:21,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-14 15:49:21,737 INFO L175 Difference]: Start difference. First operand has 227 places, 197 transitions, 1671 flow. Second operand 11 states and 147 transitions. [2024-06-14 15:49:21,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 217 transitions, 2239 flow [2024-06-14 15:49:21,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 217 transitions, 2185 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-14 15:49:21,818 INFO L231 Difference]: Finished difference. Result has 231 places, 205 transitions, 1897 flow [2024-06-14 15:49:21,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1617, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1897, PETRI_PLACES=231, PETRI_TRANSITIONS=205} [2024-06-14 15:49:21,818 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 199 predicate places. [2024-06-14 15:49:21,818 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 205 transitions, 1897 flow [2024-06-14 15:49:21,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:21,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:21,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:21,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 15:49:21,819 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:21,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:21,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1217281594, now seen corresponding path program 2 times [2024-06-14 15:49:21,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:21,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074518456] [2024-06-14 15:49:21,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:21,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:30,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:30,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074518456] [2024-06-14 15:49:30,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074518456] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:30,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:30,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:49:30,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502920264] [2024-06-14 15:49:30,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:30,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:49:30,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:30,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:49:30,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:49:30,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:49:30,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 205 transitions, 1897 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:30,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:30,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:49:30,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:31,265 INFO L124 PetriNetUnfolderBase]: 430/851 cut-off events. [2024-06-14 15:49:31,265 INFO L125 PetriNetUnfolderBase]: For 34503/34503 co-relation queries the response was YES. [2024-06-14 15:49:31,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4605 conditions, 851 events. 430/851 cut-off events. For 34503/34503 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4657 event pairs, 49 based on Foata normal form. 1/850 useless extension candidates. Maximal degree in co-relation 4501. Up to 677 conditions per place. [2024-06-14 15:49:31,272 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 167 selfloop transitions, 56 changer transitions 0/227 dead transitions. [2024-06-14 15:49:31,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 227 transitions, 2525 flow [2024-06-14 15:49:31,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:49:31,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:49:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-14 15:49:31,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39669421487603307 [2024-06-14 15:49:31,274 INFO L175 Difference]: Start difference. First operand has 231 places, 205 transitions, 1897 flow. Second operand 11 states and 144 transitions. [2024-06-14 15:49:31,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 227 transitions, 2525 flow [2024-06-14 15:49:31,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 227 transitions, 2338 flow, removed 32 selfloop flow, removed 8 redundant places. [2024-06-14 15:49:31,351 INFO L231 Difference]: Finished difference. Result has 234 places, 215 transitions, 1986 flow [2024-06-14 15:49:31,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1986, PETRI_PLACES=234, PETRI_TRANSITIONS=215} [2024-06-14 15:49:31,352 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 202 predicate places. [2024-06-14 15:49:31,352 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 215 transitions, 1986 flow [2024-06-14 15:49:31,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:31,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:31,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:31,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 15:49:31,353 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:31,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:31,353 INFO L85 PathProgramCache]: Analyzing trace with hash -987065674, now seen corresponding path program 3 times [2024-06-14 15:49:31,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:31,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251930756] [2024-06-14 15:49:31,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:31,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:39,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:39,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:39,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251930756] [2024-06-14 15:49:39,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251930756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:39,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:39,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:49:39,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992408918] [2024-06-14 15:49:39,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:39,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:49:39,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:39,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:49:39,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:49:39,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:49:39,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 215 transitions, 1986 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:39,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:39,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:49:39,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:39,661 INFO L124 PetriNetUnfolderBase]: 438/864 cut-off events. [2024-06-14 15:49:39,661 INFO L125 PetriNetUnfolderBase]: For 38766/38766 co-relation queries the response was YES. [2024-06-14 15:49:39,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4792 conditions, 864 events. 438/864 cut-off events. For 38766/38766 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4740 event pairs, 49 based on Foata normal form. 1/863 useless extension candidates. Maximal degree in co-relation 4688. Up to 667 conditions per place. [2024-06-14 15:49:39,668 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 160 selfloop transitions, 68 changer transitions 0/232 dead transitions. [2024-06-14 15:49:39,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 232 transitions, 2728 flow [2024-06-14 15:49:39,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:49:39,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:49:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-14 15:49:39,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2024-06-14 15:49:39,669 INFO L175 Difference]: Start difference. First operand has 234 places, 215 transitions, 1986 flow. Second operand 11 states and 145 transitions. [2024-06-14 15:49:39,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 232 transitions, 2728 flow [2024-06-14 15:49:39,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 232 transitions, 2516 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-14 15:49:39,753 INFO L231 Difference]: Finished difference. Result has 237 places, 219 transitions, 2035 flow [2024-06-14 15:49:39,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1774, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2035, PETRI_PLACES=237, PETRI_TRANSITIONS=219} [2024-06-14 15:49:39,756 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 205 predicate places. [2024-06-14 15:49:39,756 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 219 transitions, 2035 flow [2024-06-14 15:49:39,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:39,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:39,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:39,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 15:49:39,772 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:39,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:39,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1612751720, now seen corresponding path program 4 times [2024-06-14 15:49:39,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:39,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728360338] [2024-06-14 15:49:39,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:39,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:47,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:47,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728360338] [2024-06-14 15:49:47,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728360338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:47,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:47,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:49:47,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934450498] [2024-06-14 15:49:47,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:47,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:49:47,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:47,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:49:47,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:49:47,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:49:47,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 219 transitions, 2035 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:47,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:47,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:49:47,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:48,229 INFO L124 PetriNetUnfolderBase]: 441/869 cut-off events. [2024-06-14 15:49:48,229 INFO L125 PetriNetUnfolderBase]: For 39718/39718 co-relation queries the response was YES. [2024-06-14 15:49:48,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4859 conditions, 869 events. 441/869 cut-off events. For 39718/39718 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4790 event pairs, 49 based on Foata normal form. 1/868 useless extension candidates. Maximal degree in co-relation 4754. Up to 695 conditions per place. [2024-06-14 15:49:48,236 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 168 selfloop transitions, 61 changer transitions 0/233 dead transitions. [2024-06-14 15:49:48,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 233 transitions, 2583 flow [2024-06-14 15:49:48,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:49:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:49:48,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2024-06-14 15:49:48,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-14 15:49:48,237 INFO L175 Difference]: Start difference. First operand has 237 places, 219 transitions, 2035 flow. Second operand 11 states and 143 transitions. [2024-06-14 15:49:48,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 233 transitions, 2583 flow [2024-06-14 15:49:48,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 233 transitions, 2462 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-14 15:49:48,326 INFO L231 Difference]: Finished difference. Result has 242 places, 221 transitions, 2108 flow [2024-06-14 15:49:48,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1920, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2108, PETRI_PLACES=242, PETRI_TRANSITIONS=221} [2024-06-14 15:49:48,326 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 210 predicate places. [2024-06-14 15:49:48,326 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 221 transitions, 2108 flow [2024-06-14 15:49:48,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:48,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:48,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:48,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 15:49:48,327 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:48,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:48,328 INFO L85 PathProgramCache]: Analyzing trace with hash -183144052, now seen corresponding path program 5 times [2024-06-14 15:49:48,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:48,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969787080] [2024-06-14 15:49:48,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:48,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:49:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:49:55,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:49:55,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969787080] [2024-06-14 15:49:55,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969787080] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:49:55,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:49:55,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:49:55,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081785794] [2024-06-14 15:49:55,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:49:55,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:49:55,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:49:55,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:49:55,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:49:56,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:49:56,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 221 transitions, 2108 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:56,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:49:56,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:49:56,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:49:56,605 INFO L124 PetriNetUnfolderBase]: 439/866 cut-off events. [2024-06-14 15:49:56,605 INFO L125 PetriNetUnfolderBase]: For 37788/37788 co-relation queries the response was YES. [2024-06-14 15:49:56,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4804 conditions, 866 events. 439/866 cut-off events. For 37788/37788 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4767 event pairs, 49 based on Foata normal form. 1/865 useless extension candidates. Maximal degree in co-relation 4697. Up to 692 conditions per place. [2024-06-14 15:49:56,613 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 176 selfloop transitions, 53 changer transitions 0/233 dead transitions. [2024-06-14 15:49:56,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 233 transitions, 2594 flow [2024-06-14 15:49:56,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:49:56,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:49:56,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-14 15:49:56,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39944903581267216 [2024-06-14 15:49:56,614 INFO L175 Difference]: Start difference. First operand has 242 places, 221 transitions, 2108 flow. Second operand 11 states and 145 transitions. [2024-06-14 15:49:56,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 233 transitions, 2594 flow [2024-06-14 15:49:56,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 233 transitions, 2382 flow, removed 43 selfloop flow, removed 9 redundant places. [2024-06-14 15:49:56,695 INFO L231 Difference]: Finished difference. Result has 244 places, 221 transitions, 2008 flow [2024-06-14 15:49:56,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1896, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2008, PETRI_PLACES=244, PETRI_TRANSITIONS=221} [2024-06-14 15:49:56,696 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 212 predicate places. [2024-06-14 15:49:56,696 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 221 transitions, 2008 flow [2024-06-14 15:49:56,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:49:56,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:49:56,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:49:56,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 15:49:56,697 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:49:56,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:49:56,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1796958902, now seen corresponding path program 6 times [2024-06-14 15:49:56,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:49:56,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565244991] [2024-06-14 15:49:56,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:49:56,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:49:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:03,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:03,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:03,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565244991] [2024-06-14 15:50:03,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565244991] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:03,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:03,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:50:03,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019992051] [2024-06-14 15:50:03,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:03,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:50:03,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:03,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:50:03,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:50:04,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:50:04,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 221 transitions, 2008 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:04,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:04,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:50:04,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:04,487 INFO L124 PetriNetUnfolderBase]: 442/871 cut-off events. [2024-06-14 15:50:04,487 INFO L125 PetriNetUnfolderBase]: For 38450/38450 co-relation queries the response was YES. [2024-06-14 15:50:04,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4792 conditions, 871 events. 442/871 cut-off events. For 38450/38450 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4786 event pairs, 44 based on Foata normal form. 1/870 useless extension candidates. Maximal degree in co-relation 4684. Up to 726 conditions per place. [2024-06-14 15:50:04,495 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 188 selfloop transitions, 45 changer transitions 0/237 dead transitions. [2024-06-14 15:50:04,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 237 transitions, 2570 flow [2024-06-14 15:50:04,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:50:04,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:50:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-06-14 15:50:04,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39118457300275483 [2024-06-14 15:50:04,498 INFO L175 Difference]: Start difference. First operand has 244 places, 221 transitions, 2008 flow. Second operand 11 states and 142 transitions. [2024-06-14 15:50:04,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 237 transitions, 2570 flow [2024-06-14 15:50:04,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 237 transitions, 2369 flow, removed 7 selfloop flow, removed 12 redundant places. [2024-06-14 15:50:04,646 INFO L231 Difference]: Finished difference. Result has 243 places, 223 transitions, 1972 flow [2024-06-14 15:50:04,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1807, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1972, PETRI_PLACES=243, PETRI_TRANSITIONS=223} [2024-06-14 15:50:04,647 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 211 predicate places. [2024-06-14 15:50:04,647 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 223 transitions, 1972 flow [2024-06-14 15:50:04,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:04,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:04,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:04,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 15:50:04,647 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:04,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:04,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1834131802, now seen corresponding path program 11 times [2024-06-14 15:50:04,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:04,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350147981] [2024-06-14 15:50:04,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:04,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:12,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:12,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350147981] [2024-06-14 15:50:12,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350147981] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:12,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:12,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:12,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560798295] [2024-06-14 15:50:12,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:12,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:12,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:12,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:12,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:12,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:50:12,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 223 transitions, 1972 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:12,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:12,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:50:12,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:12,897 INFO L124 PetriNetUnfolderBase]: 449/882 cut-off events. [2024-06-14 15:50:12,898 INFO L125 PetriNetUnfolderBase]: For 41419/41419 co-relation queries the response was YES. [2024-06-14 15:50:12,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4815 conditions, 882 events. 449/882 cut-off events. For 41419/41419 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 4872 event pairs, 52 based on Foata normal form. 2/878 useless extension candidates. Maximal degree in co-relation 4706. Up to 684 conditions per place. [2024-06-14 15:50:12,906 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 178 selfloop transitions, 54 changer transitions 0/236 dead transitions. [2024-06-14 15:50:12,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 236 transitions, 2492 flow [2024-06-14 15:50:12,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:12,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:12,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2024-06-14 15:50:12,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-14 15:50:12,907 INFO L175 Difference]: Start difference. First operand has 243 places, 223 transitions, 1972 flow. Second operand 10 states and 135 transitions. [2024-06-14 15:50:12,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 236 transitions, 2492 flow [2024-06-14 15:50:13,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 236 transitions, 2272 flow, removed 37 selfloop flow, removed 10 redundant places. [2024-06-14 15:50:13,028 INFO L231 Difference]: Finished difference. Result has 243 places, 226 transitions, 1900 flow [2024-06-14 15:50:13,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1753, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1900, PETRI_PLACES=243, PETRI_TRANSITIONS=226} [2024-06-14 15:50:13,028 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 211 predicate places. [2024-06-14 15:50:13,029 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 226 transitions, 1900 flow [2024-06-14 15:50:13,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:13,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:13,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:13,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 15:50:13,029 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:13,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:13,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1840560892, now seen corresponding path program 12 times [2024-06-14 15:50:13,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:13,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810525256] [2024-06-14 15:50:13,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:13,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:19,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:19,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810525256] [2024-06-14 15:50:19,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810525256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:19,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:19,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:19,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540964396] [2024-06-14 15:50:19,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:19,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:19,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:19,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:19,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:19,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:50:19,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 226 transitions, 1900 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:19,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:19,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:50:19,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:19,935 INFO L124 PetriNetUnfolderBase]: 456/899 cut-off events. [2024-06-14 15:50:19,935 INFO L125 PetriNetUnfolderBase]: For 43039/43039 co-relation queries the response was YES. [2024-06-14 15:50:19,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4788 conditions, 899 events. 456/899 cut-off events. For 43039/43039 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5036 event pairs, 52 based on Foata normal form. 2/895 useless extension candidates. Maximal degree in co-relation 4679. Up to 696 conditions per place. [2024-06-14 15:50:19,943 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 180 selfloop transitions, 55 changer transitions 0/239 dead transitions. [2024-06-14 15:50:19,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 239 transitions, 2431 flow [2024-06-14 15:50:19,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:19,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:19,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 146 transitions. [2024-06-14 15:50:19,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44242424242424244 [2024-06-14 15:50:19,944 INFO L175 Difference]: Start difference. First operand has 243 places, 226 transitions, 1900 flow. Second operand 10 states and 146 transitions. [2024-06-14 15:50:19,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 239 transitions, 2431 flow [2024-06-14 15:50:20,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 239 transitions, 2305 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-14 15:50:20,072 INFO L231 Difference]: Finished difference. Result has 246 places, 229 transitions, 1929 flow [2024-06-14 15:50:20,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1778, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1929, PETRI_PLACES=246, PETRI_TRANSITIONS=229} [2024-06-14 15:50:20,081 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 214 predicate places. [2024-06-14 15:50:20,081 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 229 transitions, 1929 flow [2024-06-14 15:50:20,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:20,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:20,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:20,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 15:50:20,082 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:20,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:20,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1849544810, now seen corresponding path program 13 times [2024-06-14 15:50:20,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:20,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711365389] [2024-06-14 15:50:20,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:20,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:27,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:27,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711365389] [2024-06-14 15:50:27,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711365389] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:27,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:27,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:27,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406547045] [2024-06-14 15:50:27,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:27,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:27,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:27,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:27,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:27,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:50:27,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 229 transitions, 1929 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:27,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:27,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:50:27,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:27,664 INFO L124 PetriNetUnfolderBase]: 460/905 cut-off events. [2024-06-14 15:50:27,664 INFO L125 PetriNetUnfolderBase]: For 44170/44170 co-relation queries the response was YES. [2024-06-14 15:50:27,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4834 conditions, 905 events. 460/905 cut-off events. For 44170/44170 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5056 event pairs, 54 based on Foata normal form. 2/897 useless extension candidates. Maximal degree in co-relation 4724. Up to 661 conditions per place. [2024-06-14 15:50:27,672 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 146 selfloop transitions, 90 changer transitions 0/240 dead transitions. [2024-06-14 15:50:27,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 240 transitions, 2445 flow [2024-06-14 15:50:27,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:27,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-14 15:50:27,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-14 15:50:27,673 INFO L175 Difference]: Start difference. First operand has 246 places, 229 transitions, 1929 flow. Second operand 10 states and 133 transitions. [2024-06-14 15:50:27,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 240 transitions, 2445 flow [2024-06-14 15:50:27,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 240 transitions, 2328 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 15:50:27,796 INFO L231 Difference]: Finished difference. Result has 250 places, 230 transitions, 2020 flow [2024-06-14 15:50:27,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1812, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2020, PETRI_PLACES=250, PETRI_TRANSITIONS=230} [2024-06-14 15:50:27,797 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 218 predicate places. [2024-06-14 15:50:27,797 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 230 transitions, 2020 flow [2024-06-14 15:50:27,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:27,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:27,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:27,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 15:50:27,798 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:27,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:27,798 INFO L85 PathProgramCache]: Analyzing trace with hash 378057088, now seen corresponding path program 14 times [2024-06-14 15:50:27,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:27,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514297824] [2024-06-14 15:50:27,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:27,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:34,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:34,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514297824] [2024-06-14 15:50:34,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514297824] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:34,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:34,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:34,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327293816] [2024-06-14 15:50:34,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:34,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:34,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:34,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:34,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:35,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:50:35,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 230 transitions, 2020 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:35,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:35,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:50:35,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:35,348 INFO L124 PetriNetUnfolderBase]: 464/915 cut-off events. [2024-06-14 15:50:35,348 INFO L125 PetriNetUnfolderBase]: For 45444/45444 co-relation queries the response was YES. [2024-06-14 15:50:35,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4961 conditions, 915 events. 464/915 cut-off events. For 45444/45444 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5117 event pairs, 52 based on Foata normal form. 2/911 useless extension candidates. Maximal degree in co-relation 4850. Up to 692 conditions per place. [2024-06-14 15:50:35,356 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 181 selfloop transitions, 57 changer transitions 0/242 dead transitions. [2024-06-14 15:50:35,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 242 transitions, 2544 flow [2024-06-14 15:50:35,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:35,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-14 15:50:35,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-14 15:50:35,358 INFO L175 Difference]: Start difference. First operand has 250 places, 230 transitions, 2020 flow. Second operand 10 states and 137 transitions. [2024-06-14 15:50:35,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 242 transitions, 2544 flow [2024-06-14 15:50:35,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 242 transitions, 2329 flow, removed 12 selfloop flow, removed 10 redundant places. [2024-06-14 15:50:35,499 INFO L231 Difference]: Finished difference. Result has 250 places, 231 transitions, 1949 flow [2024-06-14 15:50:35,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1805, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1949, PETRI_PLACES=250, PETRI_TRANSITIONS=231} [2024-06-14 15:50:35,500 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 218 predicate places. [2024-06-14 15:50:35,500 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 231 transitions, 1949 flow [2024-06-14 15:50:35,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:35,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:35,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:35,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 15:50:35,501 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:35,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:35,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1850650552, now seen corresponding path program 15 times [2024-06-14 15:50:35,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:35,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097149303] [2024-06-14 15:50:35,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:35,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:42,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-14 15:50:42,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:42,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097149303] [2024-06-14 15:50:42,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097149303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:42,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:42,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:42,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937636341] [2024-06-14 15:50:42,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:42,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:42,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:42,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:42,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:42,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:50:42,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 231 transitions, 1949 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:42,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:42,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:50:42,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:42,844 INFO L124 PetriNetUnfolderBase]: 471/926 cut-off events. [2024-06-14 15:50:42,845 INFO L125 PetriNetUnfolderBase]: For 46745/46745 co-relation queries the response was YES. [2024-06-14 15:50:42,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4956 conditions, 926 events. 471/926 cut-off events. For 46745/46745 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5196 event pairs, 54 based on Foata normal form. 2/922 useless extension candidates. Maximal degree in co-relation 4846. Up to 724 conditions per place. [2024-06-14 15:50:42,853 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 179 selfloop transitions, 61 changer transitions 0/244 dead transitions. [2024-06-14 15:50:42,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 244 transitions, 2496 flow [2024-06-14 15:50:42,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:42,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-14 15:50:42,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2024-06-14 15:50:42,854 INFO L175 Difference]: Start difference. First operand has 250 places, 231 transitions, 1949 flow. Second operand 10 states and 134 transitions. [2024-06-14 15:50:42,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 244 transitions, 2496 flow [2024-06-14 15:50:42,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 244 transitions, 2358 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 15:50:42,985 INFO L231 Difference]: Finished difference. Result has 252 places, 234 transitions, 1984 flow [2024-06-14 15:50:42,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1815, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1984, PETRI_PLACES=252, PETRI_TRANSITIONS=234} [2024-06-14 15:50:42,985 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 220 predicate places. [2024-06-14 15:50:42,985 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 234 transitions, 1984 flow [2024-06-14 15:50:42,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:42,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:42,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:42,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 15:50:42,986 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:42,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:42,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1180514086, now seen corresponding path program 16 times [2024-06-14 15:50:42,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:42,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949703766] [2024-06-14 15:50:42,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:42,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:49,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:49,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:49,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949703766] [2024-06-14 15:50:49,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949703766] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:49,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:49,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:50:49,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561309861] [2024-06-14 15:50:49,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:49,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:50:49,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:49,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:50:49,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:50:49,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:50:49,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 234 transitions, 1984 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:49,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:49,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:50:49,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:49,915 INFO L124 PetriNetUnfolderBase]: 475/936 cut-off events. [2024-06-14 15:50:49,915 INFO L125 PetriNetUnfolderBase]: For 48069/48069 co-relation queries the response was YES. [2024-06-14 15:50:49,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5008 conditions, 936 events. 475/936 cut-off events. For 48069/48069 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5282 event pairs, 54 based on Foata normal form. 2/932 useless extension candidates. Maximal degree in co-relation 4897. Up to 732 conditions per place. [2024-06-14 15:50:49,923 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 179 selfloop transitions, 62 changer transitions 0/245 dead transitions. [2024-06-14 15:50:49,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 245 transitions, 2516 flow [2024-06-14 15:50:49,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:49,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2024-06-14 15:50:49,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-14 15:50:49,925 INFO L175 Difference]: Start difference. First operand has 252 places, 234 transitions, 1984 flow. Second operand 10 states and 143 transitions. [2024-06-14 15:50:49,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 245 transitions, 2516 flow [2024-06-14 15:50:50,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 245 transitions, 2372 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-14 15:50:50,066 INFO L231 Difference]: Finished difference. Result has 255 places, 235 transitions, 1998 flow [2024-06-14 15:50:50,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1840, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1998, PETRI_PLACES=255, PETRI_TRANSITIONS=235} [2024-06-14 15:50:50,067 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 223 predicate places. [2024-06-14 15:50:50,067 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 235 transitions, 1998 flow [2024-06-14 15:50:50,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:50,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:50,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:50,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 15:50:50,068 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:50,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:50,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1113271496, now seen corresponding path program 17 times [2024-06-14 15:50:50,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:50,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118466735] [2024-06-14 15:50:50,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:50,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:50:56,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:50:56,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:50:56,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118466735] [2024-06-14 15:50:56,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118466735] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:50:56,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:50:56,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:50:56,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213505383] [2024-06-14 15:50:56,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:50:56,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:50:56,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:50:56,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:50:56,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:50:56,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:50:56,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 235 transitions, 1998 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:56,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:50:56,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:50:56,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:50:57,430 INFO L124 PetriNetUnfolderBase]: 479/940 cut-off events. [2024-06-14 15:50:57,430 INFO L125 PetriNetUnfolderBase]: For 49288/49288 co-relation queries the response was YES. [2024-06-14 15:50:57,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5056 conditions, 940 events. 479/940 cut-off events. For 49288/49288 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5292 event pairs, 56 based on Foata normal form. 2/932 useless extension candidates. Maximal degree in co-relation 4944. Up to 697 conditions per place. [2024-06-14 15:50:57,439 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 166 selfloop transitions, 76 changer transitions 0/246 dead transitions. [2024-06-14 15:50:57,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 246 transitions, 2534 flow [2024-06-14 15:50:57,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:50:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:50:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2024-06-14 15:50:57,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-14 15:50:57,441 INFO L175 Difference]: Start difference. First operand has 255 places, 235 transitions, 1998 flow. Second operand 10 states and 135 transitions. [2024-06-14 15:50:57,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 246 transitions, 2534 flow [2024-06-14 15:50:57,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 246 transitions, 2378 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-14 15:50:57,588 INFO L231 Difference]: Finished difference. Result has 256 places, 236 transitions, 2030 flow [2024-06-14 15:50:57,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1842, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2030, PETRI_PLACES=256, PETRI_TRANSITIONS=236} [2024-06-14 15:50:57,589 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 224 predicate places. [2024-06-14 15:50:57,589 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 236 transitions, 2030 flow [2024-06-14 15:50:57,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:50:57,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:50:57,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:50:57,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 15:50:57,590 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:50:57,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:50:57,590 INFO L85 PathProgramCache]: Analyzing trace with hash 571013560, now seen corresponding path program 18 times [2024-06-14 15:50:57,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:50:57,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033924458] [2024-06-14 15:50:57,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:50:57,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:50:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:05,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:05,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033924458] [2024-06-14 15:51:05,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033924458] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:05,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:05,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:51:05,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833895974] [2024-06-14 15:51:05,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:05,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:51:05,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:05,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:51:05,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:51:05,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:51:05,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 236 transitions, 2030 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:05,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:05,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:51:05,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:05,567 INFO L124 PetriNetUnfolderBase]: 483/950 cut-off events. [2024-06-14 15:51:05,568 INFO L125 PetriNetUnfolderBase]: For 50610/50610 co-relation queries the response was YES. [2024-06-14 15:51:05,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5128 conditions, 950 events. 483/950 cut-off events. For 50610/50610 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5343 event pairs, 56 based on Foata normal form. 2/946 useless extension candidates. Maximal degree in co-relation 5016. Up to 734 conditions per place. [2024-06-14 15:51:05,576 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 183 selfloop transitions, 61 changer transitions 0/248 dead transitions. [2024-06-14 15:51:05,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 248 transitions, 2574 flow [2024-06-14 15:51:05,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:51:05,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:51:05,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-14 15:51:05,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-06-14 15:51:05,577 INFO L175 Difference]: Start difference. First operand has 256 places, 236 transitions, 2030 flow. Second operand 10 states and 136 transitions. [2024-06-14 15:51:05,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 248 transitions, 2574 flow [2024-06-14 15:51:05,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 248 transitions, 2377 flow, removed 15 selfloop flow, removed 10 redundant places. [2024-06-14 15:51:05,729 INFO L231 Difference]: Finished difference. Result has 256 places, 237 transitions, 1993 flow [2024-06-14 15:51:05,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1833, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1993, PETRI_PLACES=256, PETRI_TRANSITIONS=237} [2024-06-14 15:51:05,729 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 224 predicate places. [2024-06-14 15:51:05,729 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 237 transitions, 1993 flow [2024-06-14 15:51:05,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:05,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:05,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:05,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 15:51:05,730 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:05,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:05,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1482080968, now seen corresponding path program 19 times [2024-06-14 15:51:05,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:05,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683833499] [2024-06-14 15:51:05,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:05,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:13,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:13,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683833499] [2024-06-14 15:51:13,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683833499] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:13,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:13,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 15:51:13,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572644874] [2024-06-14 15:51:13,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:13,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 15:51:13,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:13,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 15:51:13,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 15:51:13,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:51:13,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 237 transitions, 1993 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:13,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:13,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:51:13,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:13,715 INFO L124 PetriNetUnfolderBase]: 487/958 cut-off events. [2024-06-14 15:51:13,716 INFO L125 PetriNetUnfolderBase]: For 51835/51835 co-relation queries the response was YES. [2024-06-14 15:51:13,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5136 conditions, 958 events. 487/958 cut-off events. For 51835/51835 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5433 event pairs, 56 based on Foata normal form. 2/954 useless extension candidates. Maximal degree in co-relation 5024. Up to 659 conditions per place. [2024-06-14 15:51:13,723 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 178 selfloop transitions, 69 changer transitions 0/251 dead transitions. [2024-06-14 15:51:13,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 251 transitions, 2713 flow [2024-06-14 15:51:13,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:51:13,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:51:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-14 15:51:13,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2024-06-14 15:51:13,724 INFO L175 Difference]: Start difference. First operand has 256 places, 237 transitions, 1993 flow. Second operand 10 states and 137 transitions. [2024-06-14 15:51:13,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 251 transitions, 2713 flow [2024-06-14 15:51:13,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 251 transitions, 2563 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-14 15:51:13,865 INFO L231 Difference]: Finished difference. Result has 258 places, 238 transitions, 2019 flow [2024-06-14 15:51:13,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1843, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2019, PETRI_PLACES=258, PETRI_TRANSITIONS=238} [2024-06-14 15:51:13,865 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 226 predicate places. [2024-06-14 15:51:13,865 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 238 transitions, 2019 flow [2024-06-14 15:51:13,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:13,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:13,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:13,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 15:51:13,866 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:13,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:13,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1180691716, now seen corresponding path program 20 times [2024-06-14 15:51:13,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:13,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289104968] [2024-06-14 15:51:13,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:13,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:20,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:20,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:20,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289104968] [2024-06-14 15:51:20,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289104968] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:20,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:20,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 15:51:20,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794725249] [2024-06-14 15:51:20,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:20,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 15:51:20,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:20,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 15:51:20,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 15:51:20,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:51:20,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 238 transitions, 2019 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:20,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:20,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:51:20,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:21,193 INFO L124 PetriNetUnfolderBase]: 484/951 cut-off events. [2024-06-14 15:51:21,193 INFO L125 PetriNetUnfolderBase]: For 45853/45853 co-relation queries the response was YES. [2024-06-14 15:51:21,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4922 conditions, 951 events. 484/951 cut-off events. For 45853/45853 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5399 event pairs, 57 based on Foata normal form. 2/947 useless extension candidates. Maximal degree in co-relation 4809. Up to 725 conditions per place. [2024-06-14 15:51:21,202 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 180 selfloop transitions, 65 changer transitions 0/249 dead transitions. [2024-06-14 15:51:21,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 249 transitions, 2533 flow [2024-06-14 15:51:21,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 15:51:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 15:51:21,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 144 transitions. [2024-06-14 15:51:21,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2024-06-14 15:51:21,204 INFO L175 Difference]: Start difference. First operand has 258 places, 238 transitions, 2019 flow. Second operand 10 states and 144 transitions. [2024-06-14 15:51:21,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 249 transitions, 2533 flow [2024-06-14 15:51:21,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 249 transitions, 2323 flow, removed 24 selfloop flow, removed 9 redundant places. [2024-06-14 15:51:21,353 INFO L231 Difference]: Finished difference. Result has 259 places, 238 transitions, 1943 flow [2024-06-14 15:51:21,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1809, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1943, PETRI_PLACES=259, PETRI_TRANSITIONS=238} [2024-06-14 15:51:21,353 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 227 predicate places. [2024-06-14 15:51:21,353 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 238 transitions, 1943 flow [2024-06-14 15:51:21,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:21,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:21,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:21,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 15:51:21,354 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:21,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:21,355 INFO L85 PathProgramCache]: Analyzing trace with hash 998867884, now seen corresponding path program 7 times [2024-06-14 15:51:21,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:21,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003478368] [2024-06-14 15:51:21,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:21,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:29,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:29,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:29,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003478368] [2024-06-14 15:51:29,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003478368] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:29,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:29,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:51:29,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907563377] [2024-06-14 15:51:29,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:29,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:51:29,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:29,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:51:29,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:51:29,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:51:29,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 238 transitions, 1943 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:29,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:29,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:51:29,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:29,529 INFO L124 PetriNetUnfolderBase]: 490/965 cut-off events. [2024-06-14 15:51:29,529 INFO L125 PetriNetUnfolderBase]: For 43070/43070 co-relation queries the response was YES. [2024-06-14 15:51:29,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4826 conditions, 965 events. 490/965 cut-off events. For 43070/43070 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5485 event pairs, 59 based on Foata normal form. 1/960 useless extension candidates. Maximal degree in co-relation 4714. Up to 694 conditions per place. [2024-06-14 15:51:29,539 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 160 selfloop transitions, 88 changer transitions 0/252 dead transitions. [2024-06-14 15:51:29,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 252 transitions, 2539 flow [2024-06-14 15:51:29,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:51:29,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:51:29,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-14 15:51:29,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-14 15:51:29,540 INFO L175 Difference]: Start difference. First operand has 259 places, 238 transitions, 1943 flow. Second operand 11 states and 147 transitions. [2024-06-14 15:51:29,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 252 transitions, 2539 flow [2024-06-14 15:51:29,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 252 transitions, 2261 flow, removed 10 selfloop flow, removed 11 redundant places. [2024-06-14 15:51:29,673 INFO L231 Difference]: Finished difference. Result has 259 places, 242 transitions, 1928 flow [2024-06-14 15:51:29,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1667, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1928, PETRI_PLACES=259, PETRI_TRANSITIONS=242} [2024-06-14 15:51:29,674 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 227 predicate places. [2024-06-14 15:51:29,674 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 242 transitions, 1928 flow [2024-06-14 15:51:29,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:29,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:29,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:29,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 15:51:29,675 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:29,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:29,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1603908938, now seen corresponding path program 8 times [2024-06-14 15:51:29,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:29,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908528587] [2024-06-14 15:51:29,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:29,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:38,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:38,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:38,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908528587] [2024-06-14 15:51:38,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908528587] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:38,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:38,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:51:38,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367387300] [2024-06-14 15:51:38,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:38,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:51:38,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:38,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:51:38,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:51:38,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:51:38,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 242 transitions, 1928 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:38,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:38,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:51:38,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:38,609 INFO L124 PetriNetUnfolderBase]: 501/985 cut-off events. [2024-06-14 15:51:38,611 INFO L125 PetriNetUnfolderBase]: For 48339/48339 co-relation queries the response was YES. [2024-06-14 15:51:38,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4975 conditions, 985 events. 501/985 cut-off events. For 48339/48339 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5622 event pairs, 59 based on Foata normal form. 1/980 useless extension candidates. Maximal degree in co-relation 4863. Up to 702 conditions per place. [2024-06-14 15:51:38,623 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 172 selfloop transitions, 84 changer transitions 0/260 dead transitions. [2024-06-14 15:51:38,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 260 transitions, 2788 flow [2024-06-14 15:51:38,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:51:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:51:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 162 transitions. [2024-06-14 15:51:38,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-14 15:51:38,624 INFO L175 Difference]: Start difference. First operand has 259 places, 242 transitions, 1928 flow. Second operand 12 states and 162 transitions. [2024-06-14 15:51:38,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 260 transitions, 2788 flow [2024-06-14 15:51:38,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 260 transitions, 2551 flow, removed 31 selfloop flow, removed 8 redundant places. [2024-06-14 15:51:38,769 INFO L231 Difference]: Finished difference. Result has 263 places, 248 transitions, 2020 flow [2024-06-14 15:51:38,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1695, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2020, PETRI_PLACES=263, PETRI_TRANSITIONS=248} [2024-06-14 15:51:38,770 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 231 predicate places. [2024-06-14 15:51:38,770 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 248 transitions, 2020 flow [2024-06-14 15:51:38,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:38,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:38,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:38,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-14 15:51:38,770 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:38,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:38,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1659339402, now seen corresponding path program 9 times [2024-06-14 15:51:38,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:38,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123487301] [2024-06-14 15:51:38,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:38,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:46,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:46,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123487301] [2024-06-14 15:51:46,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123487301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:46,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:46,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:51:46,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578048147] [2024-06-14 15:51:46,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:46,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:51:46,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:46,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:51:46,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:51:46,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:51:46,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 248 transitions, 2020 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:46,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:46,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:51:46,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:46,782 INFO L124 PetriNetUnfolderBase]: 507/995 cut-off events. [2024-06-14 15:51:46,783 INFO L125 PetriNetUnfolderBase]: For 49752/49752 co-relation queries the response was YES. [2024-06-14 15:51:46,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5044 conditions, 995 events. 507/995 cut-off events. For 49752/49752 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 5705 event pairs, 59 based on Foata normal form. 1/990 useless extension candidates. Maximal degree in co-relation 4931. Up to 720 conditions per place. [2024-06-14 15:51:46,791 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 178 selfloop transitions, 80 changer transitions 0/262 dead transitions. [2024-06-14 15:51:46,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 262 transitions, 2646 flow [2024-06-14 15:51:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:51:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:51:46,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 150 transitions. [2024-06-14 15:51:46,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132231404958678 [2024-06-14 15:51:46,793 INFO L175 Difference]: Start difference. First operand has 263 places, 248 transitions, 2020 flow. Second operand 11 states and 150 transitions. [2024-06-14 15:51:46,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 262 transitions, 2646 flow [2024-06-14 15:51:46,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 262 transitions, 2468 flow, removed 41 selfloop flow, removed 7 redundant places. [2024-06-14 15:51:46,938 INFO L231 Difference]: Finished difference. Result has 267 places, 252 transitions, 2099 flow [2024-06-14 15:51:46,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1852, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2099, PETRI_PLACES=267, PETRI_TRANSITIONS=252} [2024-06-14 15:51:46,939 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 235 predicate places. [2024-06-14 15:51:46,939 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 252 transitions, 2099 flow [2024-06-14 15:51:46,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:46,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:46,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:46,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-14 15:51:46,940 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:46,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:46,940 INFO L85 PathProgramCache]: Analyzing trace with hash 83513176, now seen corresponding path program 10 times [2024-06-14 15:51:46,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:46,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714927293] [2024-06-14 15:51:46,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:46,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:51:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:51:55,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:51:55,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714927293] [2024-06-14 15:51:55,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714927293] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:51:55,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:51:55,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:51:55,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107755994] [2024-06-14 15:51:55,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:51:55,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:51:55,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:51:55,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:51:55,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:51:56,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:51:56,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 252 transitions, 2099 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:56,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:51:56,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:51:56,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:51:56,425 INFO L124 PetriNetUnfolderBase]: 515/1010 cut-off events. [2024-06-14 15:51:56,426 INFO L125 PetriNetUnfolderBase]: For 54989/54989 co-relation queries the response was YES. [2024-06-14 15:51:56,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5393 conditions, 1010 events. 515/1010 cut-off events. For 54989/54989 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 5818 event pairs, 59 based on Foata normal form. 1/1005 useless extension candidates. Maximal degree in co-relation 5278. Up to 723 conditions per place. [2024-06-14 15:51:56,435 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 166 selfloop transitions, 98 changer transitions 0/268 dead transitions. [2024-06-14 15:51:56,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 268 transitions, 2971 flow [2024-06-14 15:51:56,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:51:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:51:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 160 transitions. [2024-06-14 15:51:56,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2024-06-14 15:51:56,436 INFO L175 Difference]: Start difference. First operand has 267 places, 252 transitions, 2099 flow. Second operand 12 states and 160 transitions. [2024-06-14 15:51:56,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 268 transitions, 2971 flow [2024-06-14 15:51:56,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 268 transitions, 2769 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-14 15:51:56,596 INFO L231 Difference]: Finished difference. Result has 272 places, 256 transitions, 2246 flow [2024-06-14 15:51:56,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2246, PETRI_PLACES=272, PETRI_TRANSITIONS=256} [2024-06-14 15:51:56,597 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 240 predicate places. [2024-06-14 15:51:56,597 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 256 transitions, 2246 flow [2024-06-14 15:51:56,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:51:56,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:51:56,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:51:56,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-14 15:51:56,598 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:51:56,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:51:56,598 INFO L85 PathProgramCache]: Analyzing trace with hash -363926858, now seen corresponding path program 11 times [2024-06-14 15:51:56,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:51:56,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865065470] [2024-06-14 15:51:56,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:51:56,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:51:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:04,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:04,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865065470] [2024-06-14 15:52:04,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865065470] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:04,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:04,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:52:04,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738814325] [2024-06-14 15:52:04,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:04,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:52:04,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:04,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:52:04,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:52:05,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:52:05,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 256 transitions, 2246 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:05,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:05,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:52:05,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:05,460 INFO L124 PetriNetUnfolderBase]: 523/1028 cut-off events. [2024-06-14 15:52:05,461 INFO L125 PetriNetUnfolderBase]: For 61959/61959 co-relation queries the response was YES. [2024-06-14 15:52:05,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5718 conditions, 1028 events. 523/1028 cut-off events. For 61959/61959 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 5919 event pairs, 70 based on Foata normal form. 1/1027 useless extension candidates. Maximal degree in co-relation 5602. Up to 909 conditions per place. [2024-06-14 15:52:05,471 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 244 selfloop transitions, 24 changer transitions 0/272 dead transitions. [2024-06-14 15:52:05,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 272 transitions, 3136 flow [2024-06-14 15:52:05,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:52:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:52:05,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 151 transitions. [2024-06-14 15:52:05,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3813131313131313 [2024-06-14 15:52:05,472 INFO L175 Difference]: Start difference. First operand has 272 places, 256 transitions, 2246 flow. Second operand 12 states and 151 transitions. [2024-06-14 15:52:05,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 272 transitions, 3136 flow [2024-06-14 15:52:05,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 272 transitions, 2938 flow, removed 40 selfloop flow, removed 8 redundant places. [2024-06-14 15:52:05,639 INFO L231 Difference]: Finished difference. Result has 276 places, 260 transitions, 2257 flow [2024-06-14 15:52:05,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2257, PETRI_PLACES=276, PETRI_TRANSITIONS=260} [2024-06-14 15:52:05,640 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 244 predicate places. [2024-06-14 15:52:05,640 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 260 transitions, 2257 flow [2024-06-14 15:52:05,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:05,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:05,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:05,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-14 15:52:05,641 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:05,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:05,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1604205608, now seen corresponding path program 12 times [2024-06-14 15:52:05,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:05,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942472603] [2024-06-14 15:52:05,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:05,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:13,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:13,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942472603] [2024-06-14 15:52:13,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942472603] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:13,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:13,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:52:13,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61029647] [2024-06-14 15:52:13,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:13,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:52:13,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:13,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:52:13,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:52:13,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:52:13,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 260 transitions, 2257 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:13,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:13,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:52:13,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:14,113 INFO L124 PetriNetUnfolderBase]: 526/1032 cut-off events. [2024-06-14 15:52:14,113 INFO L125 PetriNetUnfolderBase]: For 62281/62281 co-relation queries the response was YES. [2024-06-14 15:52:14,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5736 conditions, 1032 events. 526/1032 cut-off events. For 62281/62281 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 5971 event pairs, 59 based on Foata normal form. 1/1027 useless extension candidates. Maximal degree in co-relation 5618. Up to 751 conditions per place. [2024-06-14 15:52:14,123 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 186 selfloop transitions, 82 changer transitions 0/272 dead transitions. [2024-06-14 15:52:14,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 272 transitions, 2883 flow [2024-06-14 15:52:14,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:52:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:52:14,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-14 15:52:14,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41046831955922863 [2024-06-14 15:52:14,124 INFO L175 Difference]: Start difference. First operand has 276 places, 260 transitions, 2257 flow. Second operand 11 states and 149 transitions. [2024-06-14 15:52:14,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 272 transitions, 2883 flow [2024-06-14 15:52:14,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 272 transitions, 2771 flow, removed 44 selfloop flow, removed 8 redundant places. [2024-06-14 15:52:14,304 INFO L231 Difference]: Finished difference. Result has 279 places, 262 transitions, 2386 flow [2024-06-14 15:52:14,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2386, PETRI_PLACES=279, PETRI_TRANSITIONS=262} [2024-06-14 15:52:14,305 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 247 predicate places. [2024-06-14 15:52:14,305 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 262 transitions, 2386 flow [2024-06-14 15:52:14,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:14,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:14,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:14,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-14 15:52:14,306 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:14,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:14,306 INFO L85 PathProgramCache]: Analyzing trace with hash 737431914, now seen corresponding path program 13 times [2024-06-14 15:52:14,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:14,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229159485] [2024-06-14 15:52:14,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:14,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:22,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:22,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229159485] [2024-06-14 15:52:22,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229159485] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:22,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:22,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:52:22,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866385232] [2024-06-14 15:52:22,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:22,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:52:22,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:22,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:52:22,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:52:22,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:52:22,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 262 transitions, 2386 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:22,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:22,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:52:22,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:22,656 INFO L124 PetriNetUnfolderBase]: 532/1042 cut-off events. [2024-06-14 15:52:22,656 INFO L125 PetriNetUnfolderBase]: For 63394/63394 co-relation queries the response was YES. [2024-06-14 15:52:22,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5926 conditions, 1042 events. 532/1042 cut-off events. For 63394/63394 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6000 event pairs, 59 based on Foata normal form. 1/1037 useless extension candidates. Maximal degree in co-relation 5806. Up to 760 conditions per place. [2024-06-14 15:52:22,666 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 191 selfloop transitions, 81 changer transitions 0/276 dead transitions. [2024-06-14 15:52:22,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 276 transitions, 3046 flow [2024-06-14 15:52:22,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:52:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:52:22,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2024-06-14 15:52:22,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41597796143250687 [2024-06-14 15:52:22,667 INFO L175 Difference]: Start difference. First operand has 279 places, 262 transitions, 2386 flow. Second operand 11 states and 151 transitions. [2024-06-14 15:52:22,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 276 transitions, 3046 flow [2024-06-14 15:52:22,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 276 transitions, 2821 flow, removed 30 selfloop flow, removed 9 redundant places. [2024-06-14 15:52:22,864 INFO L231 Difference]: Finished difference. Result has 281 places, 266 transitions, 2426 flow [2024-06-14 15:52:22,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2165, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2426, PETRI_PLACES=281, PETRI_TRANSITIONS=266} [2024-06-14 15:52:22,865 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 249 predicate places. [2024-06-14 15:52:22,865 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 266 transitions, 2426 flow [2024-06-14 15:52:22,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:22,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:22,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:22,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-14 15:52:22,866 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:22,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:22,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1486849512, now seen corresponding path program 14 times [2024-06-14 15:52:22,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:22,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001345894] [2024-06-14 15:52:22,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:22,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:32,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:32,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001345894] [2024-06-14 15:52:32,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001345894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:32,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:32,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:52:32,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829254751] [2024-06-14 15:52:32,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:32,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:52:32,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:32,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:52:32,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:52:32,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:52:32,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 266 transitions, 2426 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:32,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:32,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:52:32,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:32,752 INFO L124 PetriNetUnfolderBase]: 530/1037 cut-off events. [2024-06-14 15:52:32,752 INFO L125 PetriNetUnfolderBase]: For 60066/60066 co-relation queries the response was YES. [2024-06-14 15:52:32,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5752 conditions, 1037 events. 530/1037 cut-off events. For 60066/60066 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6013 event pairs, 59 based on Foata normal form. 1/1032 useless extension candidates. Maximal degree in co-relation 5631. Up to 757 conditions per place. [2024-06-14 15:52:32,762 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 185 selfloop transitions, 87 changer transitions 0/276 dead transitions. [2024-06-14 15:52:32,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 276 transitions, 2992 flow [2024-06-14 15:52:32,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:52:32,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:52:32,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2024-06-14 15:52:32,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40771349862258954 [2024-06-14 15:52:32,763 INFO L175 Difference]: Start difference. First operand has 281 places, 266 transitions, 2426 flow. Second operand 11 states and 148 transitions. [2024-06-14 15:52:32,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 276 transitions, 2992 flow [2024-06-14 15:52:32,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 276 transitions, 2726 flow, removed 60 selfloop flow, removed 7 redundant places. [2024-06-14 15:52:32,958 INFO L231 Difference]: Finished difference. Result has 285 places, 266 transitions, 2339 flow [2024-06-14 15:52:32,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2160, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2339, PETRI_PLACES=285, PETRI_TRANSITIONS=266} [2024-06-14 15:52:32,959 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 253 predicate places. [2024-06-14 15:52:32,959 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 266 transitions, 2339 flow [2024-06-14 15:52:32,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:32,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:32,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:32,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-14 15:52:32,960 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:32,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:32,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1849537866, now seen corresponding path program 15 times [2024-06-14 15:52:32,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:32,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804702620] [2024-06-14 15:52:32,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:32,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:41,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:41,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804702620] [2024-06-14 15:52:41,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804702620] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:41,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:41,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:52:41,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301612182] [2024-06-14 15:52:41,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:41,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:52:41,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:41,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:52:41,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:52:41,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:52:41,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 266 transitions, 2339 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:41,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:41,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:52:41,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:42,127 INFO L124 PetriNetUnfolderBase]: 528/1036 cut-off events. [2024-06-14 15:52:42,127 INFO L125 PetriNetUnfolderBase]: For 56265/56265 co-relation queries the response was YES. [2024-06-14 15:52:42,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5544 conditions, 1036 events. 528/1036 cut-off events. For 56265/56265 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 5991 event pairs, 59 based on Foata normal form. 1/1031 useless extension candidates. Maximal degree in co-relation 5422. Up to 754 conditions per place. [2024-06-14 15:52:42,137 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 177 selfloop transitions, 95 changer transitions 0/276 dead transitions. [2024-06-14 15:52:42,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 276 transitions, 2905 flow [2024-06-14 15:52:42,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:52:42,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:52:42,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-14 15:52:42,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-14 15:52:42,138 INFO L175 Difference]: Start difference. First operand has 285 places, 266 transitions, 2339 flow. Second operand 11 states and 146 transitions. [2024-06-14 15:52:42,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 276 transitions, 2905 flow [2024-06-14 15:52:42,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 276 transitions, 2632 flow, removed 35 selfloop flow, removed 13 redundant places. [2024-06-14 15:52:42,322 INFO L231 Difference]: Finished difference. Result has 283 places, 266 transitions, 2261 flow [2024-06-14 15:52:42,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2066, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2261, PETRI_PLACES=283, PETRI_TRANSITIONS=266} [2024-06-14 15:52:42,323 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 251 predicate places. [2024-06-14 15:52:42,323 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 266 transitions, 2261 flow [2024-06-14 15:52:42,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:42,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:42,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:42,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-14 15:52:42,323 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:42,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:42,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1090924, now seen corresponding path program 16 times [2024-06-14 15:52:42,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:42,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790586086] [2024-06-14 15:52:42,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:42,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:52:52,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:52:52,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:52:52,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790586086] [2024-06-14 15:52:52,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790586086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:52:52,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:52:52,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:52:52,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851600743] [2024-06-14 15:52:52,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:52:52,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:52:52,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:52:52,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:52:52,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:52:53,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:52:53,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 266 transitions, 2261 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:53,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:52:53,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:52:53,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:52:53,477 INFO L124 PetriNetUnfolderBase]: 526/1032 cut-off events. [2024-06-14 15:52:53,477 INFO L125 PetriNetUnfolderBase]: For 52615/52615 co-relation queries the response was YES. [2024-06-14 15:52:53,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5345 conditions, 1032 events. 526/1032 cut-off events. For 52615/52615 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 5946 event pairs, 76 based on Foata normal form. 1/1031 useless extension candidates. Maximal degree in co-relation 5224. Up to 925 conditions per place. [2024-06-14 15:52:53,486 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 253 selfloop transitions, 20 changer transitions 0/277 dead transitions. [2024-06-14 15:52:53,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 277 transitions, 2831 flow [2024-06-14 15:52:53,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:52:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:52:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 146 transitions. [2024-06-14 15:52:53,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3686868686868687 [2024-06-14 15:52:53,487 INFO L175 Difference]: Start difference. First operand has 283 places, 266 transitions, 2261 flow. Second operand 12 states and 146 transitions. [2024-06-14 15:52:53,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 277 transitions, 2831 flow [2024-06-14 15:52:53,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 277 transitions, 2586 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-06-14 15:52:53,702 INFO L231 Difference]: Finished difference. Result has 286 places, 266 transitions, 2061 flow [2024-06-14 15:52:53,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2016, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2061, PETRI_PLACES=286, PETRI_TRANSITIONS=266} [2024-06-14 15:52:53,702 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 254 predicate places. [2024-06-14 15:52:53,703 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 266 transitions, 2061 flow [2024-06-14 15:52:53,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:52:53,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:52:53,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:52:53,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-14 15:52:53,703 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:52:53,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:52:53,703 INFO L85 PathProgramCache]: Analyzing trace with hash -944331782, now seen corresponding path program 17 times [2024-06-14 15:52:53,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:52:53,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558961991] [2024-06-14 15:52:53,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:52:53,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:52:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:01,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:01,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:01,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558961991] [2024-06-14 15:53:01,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558961991] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:01,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:01,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:53:01,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873916141] [2024-06-14 15:53:01,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:01,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:53:01,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:01,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:53:01,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:53:01,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:53:01,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 266 transitions, 2061 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:01,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:01,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:53:01,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:01,837 INFO L124 PetriNetUnfolderBase]: 532/1043 cut-off events. [2024-06-14 15:53:01,838 INFO L125 PetriNetUnfolderBase]: For 53812/53812 co-relation queries the response was YES. [2024-06-14 15:53:01,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5269 conditions, 1043 events. 532/1043 cut-off events. For 53812/53812 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 6049 event pairs, 59 based on Foata normal form. 1/1038 useless extension candidates. Maximal degree in co-relation 5147. Up to 760 conditions per place. [2024-06-14 15:53:01,848 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 188 selfloop transitions, 88 changer transitions 0/280 dead transitions. [2024-06-14 15:53:01,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 280 transitions, 2731 flow [2024-06-14 15:53:01,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:01,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2024-06-14 15:53:01,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40771349862258954 [2024-06-14 15:53:01,849 INFO L175 Difference]: Start difference. First operand has 286 places, 266 transitions, 2061 flow. Second operand 11 states and 148 transitions. [2024-06-14 15:53:01,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 280 transitions, 2731 flow [2024-06-14 15:53:02,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 280 transitions, 2670 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-14 15:53:02,050 INFO L231 Difference]: Finished difference. Result has 285 places, 270 transitions, 2281 flow [2024-06-14 15:53:02,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2000, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2281, PETRI_PLACES=285, PETRI_TRANSITIONS=270} [2024-06-14 15:53:02,050 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 253 predicate places. [2024-06-14 15:53:02,050 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 270 transitions, 2281 flow [2024-06-14 15:53:02,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:02,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:02,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:02,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-14 15:53:02,051 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:53:02,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:02,051 INFO L85 PathProgramCache]: Analyzing trace with hash -944035112, now seen corresponding path program 18 times [2024-06-14 15:53:02,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:02,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953355455] [2024-06-14 15:53:02,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:02,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:10,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:10,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953355455] [2024-06-14 15:53:10,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953355455] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:10,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:10,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:53:10,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451495485] [2024-06-14 15:53:10,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:10,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:53:10,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:10,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:53:10,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:53:10,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:53:10,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 270 transitions, 2281 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:10,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:10,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:53:10,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:11,278 INFO L124 PetriNetUnfolderBase]: 535/1048 cut-off events. [2024-06-14 15:53:11,279 INFO L125 PetriNetUnfolderBase]: For 55850/55850 co-relation queries the response was YES. [2024-06-14 15:53:11,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5514 conditions, 1048 events. 535/1048 cut-off events. For 55850/55850 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 6069 event pairs, 59 based on Foata normal form. 1/1043 useless extension candidates. Maximal degree in co-relation 5391. Up to 755 conditions per place. [2024-06-14 15:53:11,289 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 188 selfloop transitions, 94 changer transitions 0/286 dead transitions. [2024-06-14 15:53:11,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 286 transitions, 3229 flow [2024-06-14 15:53:11,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 15:53:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 15:53:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2024-06-14 15:53:11,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065656565656566 [2024-06-14 15:53:11,291 INFO L175 Difference]: Start difference. First operand has 285 places, 270 transitions, 2281 flow. Second operand 12 states and 161 transitions. [2024-06-14 15:53:11,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 286 transitions, 3229 flow [2024-06-14 15:53:11,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 286 transitions, 2982 flow, removed 38 selfloop flow, removed 8 redundant places. [2024-06-14 15:53:11,479 INFO L231 Difference]: Finished difference. Result has 289 places, 274 transitions, 2399 flow [2024-06-14 15:53:11,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2034, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2399, PETRI_PLACES=289, PETRI_TRANSITIONS=274} [2024-06-14 15:53:11,479 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 257 predicate places. [2024-06-14 15:53:11,479 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 274 transitions, 2399 flow [2024-06-14 15:53:11,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:11,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:11,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:11,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-14 15:53:11,480 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:53:11,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:11,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1174251032, now seen corresponding path program 19 times [2024-06-14 15:53:11,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:11,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045061292] [2024-06-14 15:53:11,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:11,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:19,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-14 15:53:19,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:19,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045061292] [2024-06-14 15:53:19,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045061292] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:19,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:19,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:53:19,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274835778] [2024-06-14 15:53:19,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:19,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:53:19,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:19,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:53:19,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:53:19,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:53:19,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 274 transitions, 2399 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:19,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:19,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:53:19,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:19,885 INFO L124 PetriNetUnfolderBase]: 541/1058 cut-off events. [2024-06-14 15:53:19,885 INFO L125 PetriNetUnfolderBase]: For 57274/57274 co-relation queries the response was YES. [2024-06-14 15:53:19,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5608 conditions, 1058 events. 541/1058 cut-off events. For 57274/57274 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 6152 event pairs, 59 based on Foata normal form. 1/1053 useless extension candidates. Maximal degree in co-relation 5484. Up to 774 conditions per place. [2024-06-14 15:53:19,895 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 195 selfloop transitions, 89 changer transitions 0/288 dead transitions. [2024-06-14 15:53:19,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 288 transitions, 3097 flow [2024-06-14 15:53:19,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:19,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-14 15:53:19,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41046831955922863 [2024-06-14 15:53:19,896 INFO L175 Difference]: Start difference. First operand has 289 places, 274 transitions, 2399 flow. Second operand 11 states and 149 transitions. [2024-06-14 15:53:19,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 288 transitions, 3097 flow [2024-06-14 15:53:20,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 288 transitions, 2869 flow, removed 60 selfloop flow, removed 8 redundant places. [2024-06-14 15:53:20,099 INFO L231 Difference]: Finished difference. Result has 292 places, 278 transitions, 2466 flow [2024-06-14 15:53:20,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2193, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2466, PETRI_PLACES=292, PETRI_TRANSITIONS=278} [2024-06-14 15:53:20,100 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 260 predicate places. [2024-06-14 15:53:20,100 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 278 transitions, 2466 flow [2024-06-14 15:53:20,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:20,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:20,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:20,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-14 15:53:20,101 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:53:20,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:20,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1180507142, now seen corresponding path program 20 times [2024-06-14 15:53:20,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:20,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223738894] [2024-06-14 15:53:20,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:20,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:27,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:27,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223738894] [2024-06-14 15:53:27,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223738894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:27,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:27,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:53:27,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803767877] [2024-06-14 15:53:27,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:27,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:53:27,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:27,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:53:27,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:53:27,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:53:27,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 278 transitions, 2466 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:27,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:27,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:53:27,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:28,363 INFO L124 PetriNetUnfolderBase]: 539/1055 cut-off events. [2024-06-14 15:53:28,363 INFO L125 PetriNetUnfolderBase]: For 52565/52565 co-relation queries the response was YES. [2024-06-14 15:53:28,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5502 conditions, 1055 events. 539/1055 cut-off events. For 52565/52565 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 6137 event pairs, 59 based on Foata normal form. 1/1050 useless extension candidates. Maximal degree in co-relation 5376. Up to 771 conditions per place. [2024-06-14 15:53:28,373 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 192 selfloop transitions, 92 changer transitions 0/288 dead transitions. [2024-06-14 15:53:28,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 288 transitions, 3056 flow [2024-06-14 15:53:28,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-14 15:53:28,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-14 15:53:28,375 INFO L175 Difference]: Start difference. First operand has 292 places, 278 transitions, 2466 flow. Second operand 11 states and 147 transitions. [2024-06-14 15:53:28,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 288 transitions, 3056 flow [2024-06-14 15:53:28,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 288 transitions, 2778 flow, removed 57 selfloop flow, removed 7 redundant places. [2024-06-14 15:53:28,562 INFO L231 Difference]: Finished difference. Result has 296 places, 278 transitions, 2377 flow [2024-06-14 15:53:28,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2188, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2377, PETRI_PLACES=296, PETRI_TRANSITIONS=278} [2024-06-14 15:53:28,562 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 264 predicate places. [2024-06-14 15:53:28,562 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 278 transitions, 2377 flow [2024-06-14 15:53:28,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:28,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:28,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:28,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-14 15:53:28,563 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:53:28,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:28,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1522303173, now seen corresponding path program 1 times [2024-06-14 15:53:28,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:28,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737800910] [2024-06-14 15:53:28,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:28,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:36,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:36,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737800910] [2024-06-14 15:53:36,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737800910] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:36,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:36,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:53:36,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452171358] [2024-06-14 15:53:36,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:36,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:53:36,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:36,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:53:36,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:53:36,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:53:36,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 278 transitions, 2377 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:36,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:36,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:53:36,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:36,723 INFO L124 PetriNetUnfolderBase]: 550/1078 cut-off events. [2024-06-14 15:53:36,723 INFO L125 PetriNetUnfolderBase]: For 67880/67880 co-relation queries the response was YES. [2024-06-14 15:53:36,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5717 conditions, 1078 events. 550/1078 cut-off events. For 67880/67880 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 6284 event pairs, 44 based on Foata normal form. 2/1078 useless extension candidates. Maximal degree in co-relation 5590. Up to 846 conditions per place. [2024-06-14 15:53:36,733 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 258 selfloop transitions, 37 changer transitions 0/299 dead transitions. [2024-06-14 15:53:36,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 299 transitions, 3235 flow [2024-06-14 15:53:36,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-14 15:53:36,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41046831955922863 [2024-06-14 15:53:36,735 INFO L175 Difference]: Start difference. First operand has 296 places, 278 transitions, 2377 flow. Second operand 11 states and 149 transitions. [2024-06-14 15:53:36,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 299 transitions, 3235 flow [2024-06-14 15:53:36,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 299 transitions, 2982 flow, removed 5 selfloop flow, removed 12 redundant places. [2024-06-14 15:53:36,915 INFO L231 Difference]: Finished difference. Result has 295 places, 280 transitions, 2232 flow [2024-06-14 15:53:36,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2232, PETRI_PLACES=295, PETRI_TRANSITIONS=280} [2024-06-14 15:53:36,916 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 263 predicate places. [2024-06-14 15:53:36,916 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 280 transitions, 2232 flow [2024-06-14 15:53:36,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:36,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:36,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:36,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-14 15:53:36,917 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:53:36,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:36,917 INFO L85 PathProgramCache]: Analyzing trace with hash -81873307, now seen corresponding path program 2 times [2024-06-14 15:53:36,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:36,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076362415] [2024-06-14 15:53:36,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:36,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:44,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-14 15:53:44,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:44,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076362415] [2024-06-14 15:53:44,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076362415] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:44,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:44,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:53:44,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61578910] [2024-06-14 15:53:44,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:44,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:53:44,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:44,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:53:44,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:53:44,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:53:44,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 280 transitions, 2232 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:44,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:44,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:53:44,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:44,723 INFO L124 PetriNetUnfolderBase]: 554/1086 cut-off events. [2024-06-14 15:53:44,723 INFO L125 PetriNetUnfolderBase]: For 69116/69116 co-relation queries the response was YES. [2024-06-14 15:53:44,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5646 conditions, 1086 events. 554/1086 cut-off events. For 69116/69116 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6354 event pairs, 57 based on Foata normal form. 2/1086 useless extension candidates. Maximal degree in co-relation 5518. Up to 897 conditions per place. [2024-06-14 15:53:44,736 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 235 selfloop transitions, 55 changer transitions 0/294 dead transitions. [2024-06-14 15:53:44,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 294 transitions, 2858 flow [2024-06-14 15:53:44,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-14 15:53:44,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39669421487603307 [2024-06-14 15:53:44,737 INFO L175 Difference]: Start difference. First operand has 295 places, 280 transitions, 2232 flow. Second operand 11 states and 144 transitions. [2024-06-14 15:53:44,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 294 transitions, 2858 flow [2024-06-14 15:53:44,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 294 transitions, 2797 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 15:53:44,906 INFO L231 Difference]: Finished difference. Result has 299 places, 281 transitions, 2304 flow [2024-06-14 15:53:44,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2171, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2304, PETRI_PLACES=299, PETRI_TRANSITIONS=281} [2024-06-14 15:53:44,907 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 267 predicate places. [2024-06-14 15:53:44,907 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 281 transitions, 2304 flow [2024-06-14 15:53:44,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:44,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:44,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:44,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-14 15:53:44,908 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:53:44,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:44,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1412277869, now seen corresponding path program 3 times [2024-06-14 15:53:44,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:44,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830100349] [2024-06-14 15:53:44,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:44,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:53:51,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:53:51,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:53:51,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830100349] [2024-06-14 15:53:51,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830100349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:53:51,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:53:51,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:53:51,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063978314] [2024-06-14 15:53:51,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:53:51,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:53:51,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:53:51,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:53:51,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:53:52,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:53:52,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 281 transitions, 2304 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:52,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:53:52,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:53:52,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:53:52,598 INFO L124 PetriNetUnfolderBase]: 565/1107 cut-off events. [2024-06-14 15:53:52,598 INFO L125 PetriNetUnfolderBase]: For 79949/79949 co-relation queries the response was YES. [2024-06-14 15:53:52,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6044 conditions, 1107 events. 565/1107 cut-off events. For 79949/79949 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6492 event pairs, 58 based on Foata normal form. 2/1107 useless extension candidates. Maximal degree in co-relation 5914. Up to 891 conditions per place. [2024-06-14 15:53:52,612 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 238 selfloop transitions, 56 changer transitions 0/298 dead transitions. [2024-06-14 15:53:52,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 298 transitions, 3162 flow [2024-06-14 15:53:52,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:53:52,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:53:52,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-14 15:53:52,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-14 15:53:52,613 INFO L175 Difference]: Start difference. First operand has 299 places, 281 transitions, 2304 flow. Second operand 11 states and 146 transitions. [2024-06-14 15:53:52,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 298 transitions, 3162 flow [2024-06-14 15:53:52,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 298 transitions, 3041 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-14 15:53:52,869 INFO L231 Difference]: Finished difference. Result has 301 places, 283 transitions, 2337 flow [2024-06-14 15:53:52,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2183, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2337, PETRI_PLACES=301, PETRI_TRANSITIONS=283} [2024-06-14 15:53:52,869 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 269 predicate places. [2024-06-14 15:53:52,869 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 283 transitions, 2337 flow [2024-06-14 15:53:52,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:53:52,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:53:52,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:53:52,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-14 15:53:52,870 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:53:52,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:53:52,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1544311149, now seen corresponding path program 4 times [2024-06-14 15:53:52,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:53:52,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962349986] [2024-06-14 15:53:52,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:53:52,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:53:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:00,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:00,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962349986] [2024-06-14 15:54:00,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962349986] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:00,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:00,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:54:00,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626488765] [2024-06-14 15:54:00,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:00,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:54:00,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:00,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:54:00,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:54:00,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:54:00,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 283 transitions, 2337 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:00,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:00,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:54:00,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:01,194 INFO L124 PetriNetUnfolderBase]: 562/1102 cut-off events. [2024-06-14 15:54:01,194 INFO L125 PetriNetUnfolderBase]: For 71200/71200 co-relation queries the response was YES. [2024-06-14 15:54:01,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5825 conditions, 1102 events. 562/1102 cut-off events. For 71200/71200 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6440 event pairs, 61 based on Foata normal form. 2/1102 useless extension candidates. Maximal degree in co-relation 5694. Up to 913 conditions per place. [2024-06-14 15:54:01,205 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 232 selfloop transitions, 60 changer transitions 0/296 dead transitions. [2024-06-14 15:54:01,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 296 transitions, 2951 flow [2024-06-14 15:54:01,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:54:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:54:01,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2024-06-14 15:54:01,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-14 15:54:01,206 INFO L175 Difference]: Start difference. First operand has 301 places, 283 transitions, 2337 flow. Second operand 11 states and 143 transitions. [2024-06-14 15:54:01,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 296 transitions, 2951 flow [2024-06-14 15:54:01,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 296 transitions, 2852 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-14 15:54:01,434 INFO L231 Difference]: Finished difference. Result has 305 places, 283 transitions, 2363 flow [2024-06-14 15:54:01,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2238, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2363, PETRI_PLACES=305, PETRI_TRANSITIONS=283} [2024-06-14 15:54:01,434 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 273 predicate places. [2024-06-14 15:54:01,434 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 283 transitions, 2363 flow [2024-06-14 15:54:01,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:01,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:01,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:01,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-14 15:54:01,435 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:54:01,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:01,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1607539473, now seen corresponding path program 5 times [2024-06-14 15:54:01,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:01,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112159727] [2024-06-14 15:54:01,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:01,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:08,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:08,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112159727] [2024-06-14 15:54:08,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112159727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:08,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:08,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:54:08,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629860814] [2024-06-14 15:54:08,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:08,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:54:08,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:08,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:54:08,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:54:09,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:54:09,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 283 transitions, 2363 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:09,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:09,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:54:09,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:09,730 INFO L124 PetriNetUnfolderBase]: 566/1109 cut-off events. [2024-06-14 15:54:09,731 INFO L125 PetriNetUnfolderBase]: For 72924/72924 co-relation queries the response was YES. [2024-06-14 15:54:09,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5920 conditions, 1109 events. 566/1109 cut-off events. For 72924/72924 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6547 event pairs, 56 based on Foata normal form. 2/1109 useless extension candidates. Maximal degree in co-relation 5787. Up to 869 conditions per place. [2024-06-14 15:54:09,742 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 223 selfloop transitions, 70 changer transitions 0/297 dead transitions. [2024-06-14 15:54:09,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 297 transitions, 2999 flow [2024-06-14 15:54:09,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:54:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:54:09,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-14 15:54:09,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-14 15:54:09,745 INFO L175 Difference]: Start difference. First operand has 305 places, 283 transitions, 2363 flow. Second operand 11 states and 147 transitions. [2024-06-14 15:54:09,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 297 transitions, 2999 flow [2024-06-14 15:54:09,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 297 transitions, 2871 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-14 15:54:09,938 INFO L231 Difference]: Finished difference. Result has 306 places, 284 transitions, 2402 flow [2024-06-14 15:54:09,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2235, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2402, PETRI_PLACES=306, PETRI_TRANSITIONS=284} [2024-06-14 15:54:09,939 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 274 predicate places. [2024-06-14 15:54:09,939 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 284 transitions, 2402 flow [2024-06-14 15:54:09,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:09,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:09,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:09,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-14 15:54:09,940 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:54:09,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:09,940 INFO L85 PathProgramCache]: Analyzing trace with hash -465873805, now seen corresponding path program 6 times [2024-06-14 15:54:09,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:09,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797269180] [2024-06-14 15:54:09,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:09,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:16,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:16,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:16,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797269180] [2024-06-14 15:54:16,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797269180] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:16,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:16,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:54:16,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512321315] [2024-06-14 15:54:16,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:16,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:54:16,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:16,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:54:16,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:54:17,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:54:17,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 284 transitions, 2402 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:17,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:17,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:54:17,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:17,503 INFO L124 PetriNetUnfolderBase]: 570/1118 cut-off events. [2024-06-14 15:54:17,504 INFO L125 PetriNetUnfolderBase]: For 73820/73820 co-relation queries the response was YES. [2024-06-14 15:54:17,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6015 conditions, 1118 events. 570/1118 cut-off events. For 73820/73820 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6584 event pairs, 63 based on Foata normal form. 2/1118 useless extension candidates. Maximal degree in co-relation 5881. Up to 913 conditions per place. [2024-06-14 15:54:17,515 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 244 selfloop transitions, 51 changer transitions 0/299 dead transitions. [2024-06-14 15:54:17,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 299 transitions, 3046 flow [2024-06-14 15:54:17,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:54:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:54:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-14 15:54:17,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-14 15:54:17,517 INFO L175 Difference]: Start difference. First operand has 306 places, 284 transitions, 2402 flow. Second operand 11 states and 147 transitions. [2024-06-14 15:54:17,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 299 transitions, 3046 flow [2024-06-14 15:54:17,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 299 transitions, 2891 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-14 15:54:17,735 INFO L231 Difference]: Finished difference. Result has 308 places, 285 transitions, 2377 flow [2024-06-14 15:54:17,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2247, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2377, PETRI_PLACES=308, PETRI_TRANSITIONS=285} [2024-06-14 15:54:17,735 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 276 predicate places. [2024-06-14 15:54:17,735 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 285 transitions, 2377 flow [2024-06-14 15:54:17,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:17,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:17,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:17,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-14 15:54:17,736 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:54:17,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:17,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1831143163, now seen corresponding path program 7 times [2024-06-14 15:54:17,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:17,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563904780] [2024-06-14 15:54:17,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:17,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:26,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-14 15:54:26,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:26,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563904780] [2024-06-14 15:54:26,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563904780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:26,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:26,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:54:26,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689526739] [2024-06-14 15:54:26,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:26,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:54:26,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:26,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:54:26,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:54:26,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:54:26,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 285 transitions, 2377 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:26,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:26,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:54:26,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:26,725 INFO L124 PetriNetUnfolderBase]: 574/1126 cut-off events. [2024-06-14 15:54:26,726 INFO L125 PetriNetUnfolderBase]: For 75839/75839 co-relation queries the response was YES. [2024-06-14 15:54:26,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6031 conditions, 1126 events. 574/1126 cut-off events. For 75839/75839 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 6634 event pairs, 57 based on Foata normal form. 2/1126 useless extension candidates. Maximal degree in co-relation 5896. Up to 897 conditions per place. [2024-06-14 15:54:26,737 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 246 selfloop transitions, 51 changer transitions 0/301 dead transitions. [2024-06-14 15:54:26,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 301 transitions, 3029 flow [2024-06-14 15:54:26,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:54:26,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:54:26,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-14 15:54:26,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41046831955922863 [2024-06-14 15:54:26,739 INFO L175 Difference]: Start difference. First operand has 308 places, 285 transitions, 2377 flow. Second operand 11 states and 149 transitions. [2024-06-14 15:54:26,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 301 transitions, 3029 flow [2024-06-14 15:54:27,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 301 transitions, 2909 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-14 15:54:27,045 INFO L231 Difference]: Finished difference. Result has 310 places, 286 transitions, 2389 flow [2024-06-14 15:54:27,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2257, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2389, PETRI_PLACES=310, PETRI_TRANSITIONS=286} [2024-06-14 15:54:27,046 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 278 predicate places. [2024-06-14 15:54:27,046 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 286 transitions, 2389 flow [2024-06-14 15:54:27,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:27,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:27,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:27,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-14 15:54:27,047 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:54:27,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:27,047 INFO L85 PathProgramCache]: Analyzing trace with hash -753017211, now seen corresponding path program 8 times [2024-06-14 15:54:27,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:27,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698131642] [2024-06-14 15:54:27,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:27,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:35,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:35,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698131642] [2024-06-14 15:54:35,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698131642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:35,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:35,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:54:35,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942952622] [2024-06-14 15:54:35,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:35,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:54:35,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:35,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:54:35,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:54:35,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:54:35,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 286 transitions, 2389 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:35,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:35,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:54:35,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:36,243 INFO L124 PetriNetUnfolderBase]: 578/1133 cut-off events. [2024-06-14 15:54:36,243 INFO L125 PetriNetUnfolderBase]: For 77940/77940 co-relation queries the response was YES. [2024-06-14 15:54:36,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6085 conditions, 1133 events. 578/1133 cut-off events. For 77940/77940 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 6701 event pairs, 62 based on Foata normal form. 2/1133 useless extension candidates. Maximal degree in co-relation 5949. Up to 893 conditions per place. [2024-06-14 15:54:36,254 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 222 selfloop transitions, 74 changer transitions 0/300 dead transitions. [2024-06-14 15:54:36,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 300 transitions, 3037 flow [2024-06-14 15:54:36,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:54:36,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:54:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-14 15:54:36,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4022038567493113 [2024-06-14 15:54:36,256 INFO L175 Difference]: Start difference. First operand has 310 places, 286 transitions, 2389 flow. Second operand 11 states and 146 transitions. [2024-06-14 15:54:36,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 300 transitions, 3037 flow [2024-06-14 15:54:36,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 300 transitions, 2915 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-14 15:54:36,497 INFO L231 Difference]: Finished difference. Result has 312 places, 287 transitions, 2448 flow [2024-06-14 15:54:36,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2267, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2448, PETRI_PLACES=312, PETRI_TRANSITIONS=287} [2024-06-14 15:54:36,497 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 280 predicate places. [2024-06-14 15:54:36,497 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 287 transitions, 2448 flow [2024-06-14 15:54:36,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:36,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:36,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:36,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-14 15:54:36,498 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:54:36,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:36,498 INFO L85 PathProgramCache]: Analyzing trace with hash -753022791, now seen corresponding path program 9 times [2024-06-14 15:54:36,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:36,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715247816] [2024-06-14 15:54:36,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:36,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:54:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:54:44,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:54:44,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715247816] [2024-06-14 15:54:44,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715247816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:54:44,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:54:44,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 15:54:44,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564257619] [2024-06-14 15:54:44,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:54:44,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 15:54:44,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:54:44,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 15:54:44,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 15:54:44,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:54:44,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 287 transitions, 2448 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:44,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:54:44,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:54:44,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:54:45,026 INFO L124 PetriNetUnfolderBase]: 582/1142 cut-off events. [2024-06-14 15:54:45,027 INFO L125 PetriNetUnfolderBase]: For 79624/79624 co-relation queries the response was YES. [2024-06-14 15:54:45,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6174 conditions, 1142 events. 582/1142 cut-off events. For 79624/79624 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 6752 event pairs, 63 based on Foata normal form. 2/1142 useless extension candidates. Maximal degree in co-relation 6037. Up to 937 conditions per place. [2024-06-14 15:54:45,040 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 246 selfloop transitions, 52 changer transitions 0/302 dead transitions. [2024-06-14 15:54:45,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 302 transitions, 3104 flow [2024-06-14 15:54:45,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 15:54:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 15:54:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-14 15:54:45,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049586776859504 [2024-06-14 15:54:45,041 INFO L175 Difference]: Start difference. First operand has 312 places, 287 transitions, 2448 flow. Second operand 11 states and 147 transitions. [2024-06-14 15:54:45,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 302 transitions, 3104 flow [2024-06-14 15:54:45,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 302 transitions, 2935 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-14 15:54:45,312 INFO L231 Difference]: Finished difference. Result has 314 places, 288 transitions, 2417 flow [2024-06-14 15:54:45,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2279, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2417, PETRI_PLACES=314, PETRI_TRANSITIONS=288} [2024-06-14 15:54:45,327 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 282 predicate places. [2024-06-14 15:54:45,328 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 288 transitions, 2417 flow [2024-06-14 15:54:45,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:54:45,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:54:45,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:54:45,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-14 15:54:45,328 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:54:45,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:54:45,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1973246233, now seen corresponding path program 10 times [2024-06-14 15:54:45,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:54:45,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453847519] [2024-06-14 15:54:45,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:54:45,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:54:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15