./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix000.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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/mix000.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix000.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 14:22:31,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 14:22:31,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 14:22:31,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 14:22:31,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 14:22:31,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 14:22:31,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 14:22:31,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 14:22:31,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 14:22:31,721 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 14:22:31,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 14:22:31,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 14:22:31,723 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 14:22:31,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 14:22:31,725 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 14:22:31,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 14:22:31,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 14:22:31,725 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 14:22:31,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 14:22:31,726 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 14:22:31,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 14:22:31,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 14:22:31,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 14:22:31,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 14:22:31,728 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 14:22:31,728 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 14:22:31,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 14:22:31,728 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 14:22:31,729 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 14:22:31,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 14:22:31,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 14:22:31,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 14:22:31,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:22:31,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 14:22:31,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 14:22:31,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 14:22:31,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 14:22:31,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 14:22:31,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 14:22:31,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 14:22:31,732 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 14:22:31,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 14:22:31,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 14:22:31,733 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 14:22:31,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 14:22:31,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 14:22:31,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 14:22:31,943 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 14:22:31,944 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 14:22:31,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix000.oepc.yml/witness.yml [2024-06-14 14:22:32,077 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 14:22:32,077 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 14:22:32,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i [2024-06-14 14:22:33,295 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 14:22:33,523 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 14:22:33,524 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.oepc.i [2024-06-14 14:22:33,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/385074661/45f006a767a845bcbc8a1e0e3fa68b18/FLAG89a8ec7fa [2024-06-14 14:22:33,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/385074661/45f006a767a845bcbc8a1e0e3fa68b18 [2024-06-14 14:22:33,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 14:22:33,552 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 14:22:33,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 14:22:33,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 14:22:33,557 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 14:22:33,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:22:32" (1/2) ... [2024-06-14 14:22:33,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@439a30e2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:33, skipping insertion in model container [2024-06-14 14:22:33,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:22:32" (1/2) ... [2024-06-14 14:22:33,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@460c58de and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:22:33, skipping insertion in model container [2024-06-14 14:22:33,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:22:33" (2/2) ... [2024-06-14 14:22:33,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@439a30e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:33, skipping insertion in model container [2024-06-14 14:22:33,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:22:33" (2/2) ... [2024-06-14 14:22:33,561 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 14:22:33,619 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 14:22:33,620 INFO L97 edCorrectnessWitness]: Location invariant before [L834-L834] (((((((((((((((((! multithreaded || y$r_buff1_thd2 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0) [2024-06-14 14:22:33,621 INFO L97 edCorrectnessWitness]: Location invariant before [L835-L835] (((((((((((((((((! multithreaded || y$r_buff1_thd2 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0) [2024-06-14 14:22:33,621 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 14:22:33,621 INFO L106 edCorrectnessWitness]: ghost_update [L832-L832] multithreaded = 1; [2024-06-14 14:22:33,647 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 14:22:33,865 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:22:33,872 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 14:22:34,065 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 14:22:34,131 INFO L206 MainTranslator]: Completed translation [2024-06-14 14:22:34,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:34 WrapperNode [2024-06-14 14:22:34,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 14:22:34,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 14:22:34,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 14:22:34,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 14:22:34,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,244 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-06-14 14:22:34,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 14:22:34,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 14:22:34,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 14:22:34,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 14:22:34,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,305 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-14 14:22:34,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,335 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,356 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 14:22:34,358 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 14:22:34,358 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 14:22:34,358 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 14:22:34,359 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:34" (1/1) ... [2024-06-14 14:22:34,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 14:22:34,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 14:22:34,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 14:22:34,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 14:22:34,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 14:22:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 14:22:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 14:22:34,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 14:22:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 14:22:34,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 14:22:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 14:22:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 14:22:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 14:22:34,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 14:22:34,480 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 14:22:34,607 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 14:22:34,609 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 14:22:35,242 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 14:22:35,242 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 14:22:35,430 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 14:22:35,430 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 14:22:35,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:22:35 BoogieIcfgContainer [2024-06-14 14:22:35,432 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 14:22:35,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 14:22:35,435 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 14:22:35,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 14:22:35,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:22:32" (1/4) ... [2024-06-14 14:22:35,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696be4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:22:35, skipping insertion in model container [2024-06-14 14:22:35,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:22:33" (2/4) ... [2024-06-14 14:22:35,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:22:35, skipping insertion in model container [2024-06-14 14:22:35,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:22:34" (3/4) ... [2024-06-14 14:22:35,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:22:35, skipping insertion in model container [2024-06-14 14:22:35,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:22:35" (4/4) ... [2024-06-14 14:22:35,444 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.oepc.i [2024-06-14 14:22:35,457 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 14:22:35,457 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 14:22:35,458 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 14:22:35,516 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 14:22:35,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 72 flow [2024-06-14 14:22:35,573 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-14 14:22:35,573 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:22:35,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 14:22:35,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 72 flow [2024-06-14 14:22:35,577 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-06-14 14:22:35,587 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 14:22:35,593 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;@52fefa75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 14:22:35,593 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 14:22:35,599 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 14:22:35,599 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-14 14:22:35,600 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 14:22:35,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:35,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 14:22:35,600 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:35,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:35,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1460724257, now seen corresponding path program 1 times [2024-06-14 14:22:35,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:35,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363409536] [2024-06-14 14:22:35,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:35,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:38,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:38,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363409536] [2024-06-14 14:22:38,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363409536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:38,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:38,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 14:22:38,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707434421] [2024-06-14 14:22:38,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:38,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 14:22:38,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:38,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 14:22:39,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 14:22:39,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 14:22:39,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:39,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:39,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 14:22:39,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:39,302 INFO L124 PetriNetUnfolderBase]: 162/310 cut-off events. [2024-06-14 14:22:39,303 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-14 14:22:39,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 310 events. 162/310 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1182 event pairs, 97 based on Foata normal form. 1/304 useless extension candidates. Maximal degree in co-relation 609. Up to 288 conditions per place. [2024-06-14 14:22:39,308 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 23 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-14 14:22:39,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 121 flow [2024-06-14 14:22:39,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 14:22:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 14:22:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2024-06-14 14:22:39,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2024-06-14 14:22:39,320 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 55 transitions. [2024-06-14 14:22:39,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 121 flow [2024-06-14 14:22:39,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 14:22:39,324 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2024-06-14 14:22:39,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-14 14:22:39,328 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-14 14:22:39,328 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2024-06-14 14:22:39,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:39,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:39,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:39,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 14:22:39,329 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:39,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:39,330 INFO L85 PathProgramCache]: Analyzing trace with hash 698380346, now seen corresponding path program 1 times [2024-06-14 14:22:39,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:39,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451772998] [2024-06-14 14:22:39,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:39,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:41,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:41,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451772998] [2024-06-14 14:22:41,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451772998] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:41,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:41,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 14:22:41,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990664237] [2024-06-14 14:22:41,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:41,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 14:22:41,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:41,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 14:22:41,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 14:22:41,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 14:22:41,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:41,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:41,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 14:22:41,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:42,120 INFO L124 PetriNetUnfolderBase]: 159/307 cut-off events. [2024-06-14 14:22:42,120 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-06-14 14:22:42,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 307 events. 159/307 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1169 event pairs, 79 based on Foata normal form. 2/308 useless extension candidates. Maximal degree in co-relation 682. Up to 274 conditions per place. [2024-06-14 14:22:42,123 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 27 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-14 14:22:42,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 163 flow [2024-06-14 14:22:42,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 14:22:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 14:22:42,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2024-06-14 14:22:42,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.546875 [2024-06-14 14:22:42,125 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 4 states and 70 transitions. [2024-06-14 14:22:42,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 163 flow [2024-06-14 14:22:42,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 14:22:42,126 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 97 flow [2024-06-14 14:22:42,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-14 14:22:42,127 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-14 14:22:42,127 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 97 flow [2024-06-14 14:22:42,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:42,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:42,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:42,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 14:22:42,128 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:42,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:42,129 INFO L85 PathProgramCache]: Analyzing trace with hash 173167718, now seen corresponding path program 1 times [2024-06-14 14:22:42,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:42,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342300982] [2024-06-14 14:22:42,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:42,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:45,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:45,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:45,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342300982] [2024-06-14 14:22:45,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342300982] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:45,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:45,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 14:22:45,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320899229] [2024-06-14 14:22:45,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:45,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 14:22:45,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:45,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 14:22:45,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-14 14:22:45,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-14 14:22:45,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:45,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:45,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-14 14:22:45,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:45,925 INFO L124 PetriNetUnfolderBase]: 153/301 cut-off events. [2024-06-14 14:22:45,925 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2024-06-14 14:22:45,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 301 events. 153/301 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1116 event pairs, 43 based on Foata normal form. 4/304 useless extension candidates. Maximal degree in co-relation 733. Up to 246 conditions per place. [2024-06-14 14:22:45,927 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 32 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-14 14:22:45,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 215 flow [2024-06-14 14:22:45,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:22:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:22:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2024-06-14 14:22:45,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375 [2024-06-14 14:22:45,929 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 97 flow. Second operand 5 states and 86 transitions. [2024-06-14 14:22:45,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 215 flow [2024-06-14 14:22:45,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 206 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 14:22:45,931 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 121 flow [2024-06-14 14:22:45,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-14 14:22:45,932 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-14 14:22:45,932 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 121 flow [2024-06-14 14:22:45,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:45,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:45,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:45,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 14:22:45,933 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 14:22:45,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:45,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1532684601, now seen corresponding path program 1 times [2024-06-14 14:22:45,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:45,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931041860] [2024-06-14 14:22:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:45,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:50,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:50,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931041860] [2024-06-14 14:22:50,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931041860] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:50,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:50,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 14:22:50,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898302188] [2024-06-14 14:22:50,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:50,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 14:22:50,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:50,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 14:22:50,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 14:22:50,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:22:50,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:50,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:50,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:22:50,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:50,933 INFO L124 PetriNetUnfolderBase]: 211/380 cut-off events. [2024-06-14 14:22:50,933 INFO L125 PetriNetUnfolderBase]: For 353/353 co-relation queries the response was YES. [2024-06-14 14:22:50,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 380 events. 211/380 cut-off events. For 353/353 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1339 event pairs, 92 based on Foata normal form. 1/380 useless extension candidates. Maximal degree in co-relation 1037. Up to 368 conditions per place. [2024-06-14 14:22:50,937 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 29 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2024-06-14 14:22:50,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 209 flow [2024-06-14 14:22:50,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 14:22:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 14:22:50,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2024-06-14 14:22:50,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 14:22:50,941 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 121 flow. Second operand 5 states and 62 transitions. [2024-06-14 14:22:50,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 209 flow [2024-06-14 14:22:50,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 194 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 14:22:50,944 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 133 flow [2024-06-14 14:22:50,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2024-06-14 14:22:50,945 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-06-14 14:22:50,945 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 133 flow [2024-06-14 14:22:50,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:50,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:50,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:50,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 14:22:50,946 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:50,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:50,947 INFO L85 PathProgramCache]: Analyzing trace with hash 584721724, now seen corresponding path program 1 times [2024-06-14 14:22:50,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:50,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879501549] [2024-06-14 14:22:50,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:50,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:54,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:54,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879501549] [2024-06-14 14:22:54,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879501549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:54,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:54,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:22:54,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637023688] [2024-06-14 14:22:54,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:54,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:22:54,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:54,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:22:54,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:22:54,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-14 14:22:54,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 133 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:54,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:54,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-14 14:22:54,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:54,926 INFO L124 PetriNetUnfolderBase]: 190/355 cut-off events. [2024-06-14 14:22:54,926 INFO L125 PetriNetUnfolderBase]: For 526/526 co-relation queries the response was YES. [2024-06-14 14:22:54,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 355 events. 190/355 cut-off events. For 526/526 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1259 event pairs, 34 based on Foata normal form. 4/358 useless extension candidates. Maximal degree in co-relation 1002. Up to 272 conditions per place. [2024-06-14 14:22:54,929 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 38 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2024-06-14 14:22:54,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 273 flow [2024-06-14 14:22:54,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:22:54,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:22:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2024-06-14 14:22:54,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2024-06-14 14:22:54,930 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 133 flow. Second operand 7 states and 105 transitions. [2024-06-14 14:22:54,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 273 flow [2024-06-14 14:22:54,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 262 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 14:22:54,936 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 149 flow [2024-06-14 14:22:54,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=149, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2024-06-14 14:22:54,938 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2024-06-14 14:22:54,939 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 149 flow [2024-06-14 14:22:54,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:54,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:54,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:54,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 14:22:54,947 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:54,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:54,947 INFO L85 PathProgramCache]: Analyzing trace with hash -268581436, now seen corresponding path program 1 times [2024-06-14 14:22:54,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:54,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184155202] [2024-06-14 14:22:54,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:54,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:22:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:22:59,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:22:59,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184155202] [2024-06-14 14:22:59,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184155202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:22:59,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:22:59,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:22:59,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063853745] [2024-06-14 14:22:59,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:22:59,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:22:59,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:22:59,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:22:59,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:22:59,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:22:59,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 149 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:59,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:22:59,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:22:59,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:22:59,892 INFO L124 PetriNetUnfolderBase]: 201/363 cut-off events. [2024-06-14 14:22:59,893 INFO L125 PetriNetUnfolderBase]: For 701/701 co-relation queries the response was YES. [2024-06-14 14:22:59,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 363 events. 201/363 cut-off events. For 701/701 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1230 event pairs, 67 based on Foata normal form. 3/365 useless extension candidates. Maximal degree in co-relation 1114. Up to 342 conditions per place. [2024-06-14 14:22:59,895 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 33 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2024-06-14 14:22:59,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 257 flow [2024-06-14 14:22:59,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:22:59,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:22:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2024-06-14 14:22:59,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 14:22:59,896 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 149 flow. Second operand 6 states and 72 transitions. [2024-06-14 14:22:59,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 257 flow [2024-06-14 14:22:59,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 235 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 14:22:59,898 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 160 flow [2024-06-14 14:22:59,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2024-06-14 14:22:59,899 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-06-14 14:22:59,899 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 160 flow [2024-06-14 14:22:59,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:22:59,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:22:59,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:22:59,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 14:22:59,900 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:22:59,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:22:59,900 INFO L85 PathProgramCache]: Analyzing trace with hash 636740918, now seen corresponding path program 1 times [2024-06-14 14:22:59,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:22:59,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952185465] [2024-06-14 14:22:59,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:22:59,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:22:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:04,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:04,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:04,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952185465] [2024-06-14 14:23:04,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952185465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:04,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:04,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:23:04,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587064750] [2024-06-14 14:23:04,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:04,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:23:04,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:04,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:23:04,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:23:04,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:23:04,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 160 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:04,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:04,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:23:04,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:04,766 INFO L124 PetriNetUnfolderBase]: 204/368 cut-off events. [2024-06-14 14:23:04,767 INFO L125 PetriNetUnfolderBase]: For 854/854 co-relation queries the response was YES. [2024-06-14 14:23:04,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 368 events. 204/368 cut-off events. For 854/854 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1259 event pairs, 67 based on Foata normal form. 1/368 useless extension candidates. Maximal degree in co-relation 1181. Up to 340 conditions per place. [2024-06-14 14:23:04,769 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 36 selfloop transitions, 11 changer transitions 0/49 dead transitions. [2024-06-14 14:23:04,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 306 flow [2024-06-14 14:23:04,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:23:04,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:23:04,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2024-06-14 14:23:04,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 14:23:04,771 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 160 flow. Second operand 6 states and 76 transitions. [2024-06-14 14:23:04,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 306 flow [2024-06-14 14:23:04,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 289 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 14:23:04,774 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 190 flow [2024-06-14 14:23:04,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-06-14 14:23:04,775 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2024-06-14 14:23:04,775 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 190 flow [2024-06-14 14:23:04,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:04,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:04,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:04,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 14:23:04,776 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:04,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:04,777 INFO L85 PathProgramCache]: Analyzing trace with hash 293395208, now seen corresponding path program 2 times [2024-06-14 14:23:04,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:04,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422720645] [2024-06-14 14:23:04,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:04,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:08,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:08,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422720645] [2024-06-14 14:23:08,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422720645] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:08,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:08,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 14:23:08,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140611552] [2024-06-14 14:23:08,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:08,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 14:23:08,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:08,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 14:23:08,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 14:23:08,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:23:08,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 190 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:08,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:08,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:23:08,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:09,128 INFO L124 PetriNetUnfolderBase]: 202/365 cut-off events. [2024-06-14 14:23:09,128 INFO L125 PetriNetUnfolderBase]: For 1087/1087 co-relation queries the response was YES. [2024-06-14 14:23:09,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1257 conditions, 365 events. 202/365 cut-off events. For 1087/1087 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1241 event pairs, 66 based on Foata normal form. 1/365 useless extension candidates. Maximal degree in co-relation 1233. Up to 350 conditions per place. [2024-06-14 14:23:09,134 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 35 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2024-06-14 14:23:09,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 290 flow [2024-06-14 14:23:09,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 14:23:09,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 14:23:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2024-06-14 14:23:09,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-14 14:23:09,138 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 190 flow. Second operand 6 states and 70 transitions. [2024-06-14 14:23:09,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 290 flow [2024-06-14 14:23:09,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 278 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-14 14:23:09,141 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 199 flow [2024-06-14 14:23:09,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2024-06-14 14:23:09,143 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2024-06-14 14:23:09,143 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 199 flow [2024-06-14 14:23:09,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:09,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:09,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:09,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 14:23:09,144 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:09,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:09,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1965014730, now seen corresponding path program 1 times [2024-06-14 14:23:09,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:09,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511504773] [2024-06-14 14:23:09,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:09,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:14,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:14,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511504773] [2024-06-14 14:23:14,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511504773] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:14,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:14,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:23:14,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859204380] [2024-06-14 14:23:14,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:14,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:23:14,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:14,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:23:14,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:23:14,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:23:14,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 199 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:14,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:14,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:23:14,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:14,629 INFO L124 PetriNetUnfolderBase]: 205/370 cut-off events. [2024-06-14 14:23:14,629 INFO L125 PetriNetUnfolderBase]: For 1395/1395 co-relation queries the response was YES. [2024-06-14 14:23:14,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 370 events. 205/370 cut-off events. For 1395/1395 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1266 event pairs, 66 based on Foata normal form. 1/370 useless extension candidates. Maximal degree in co-relation 1299. Up to 325 conditions per place. [2024-06-14 14:23:14,632 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 39 selfloop transitions, 16 changer transitions 0/57 dead transitions. [2024-06-14 14:23:14,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 379 flow [2024-06-14 14:23:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:23:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:23:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-14 14:23:14,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39732142857142855 [2024-06-14 14:23:14,633 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 199 flow. Second operand 7 states and 89 transitions. [2024-06-14 14:23:14,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 379 flow [2024-06-14 14:23:14,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 358 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-14 14:23:14,637 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 239 flow [2024-06-14 14:23:14,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=239, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2024-06-14 14:23:14,638 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 23 predicate places. [2024-06-14 14:23:14,638 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 239 flow [2024-06-14 14:23:14,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:14,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:14,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:14,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 14:23:14,639 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:14,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:14,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1965164460, now seen corresponding path program 2 times [2024-06-14 14:23:14,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:14,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704758474] [2024-06-14 14:23:14,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:14,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:19,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:19,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704758474] [2024-06-14 14:23:19,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704758474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:19,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:19,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:23:19,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011718354] [2024-06-14 14:23:19,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:19,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:23:19,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:19,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:23:19,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:23:19,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:23:19,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 239 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:19,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:19,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:23:19,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:19,907 INFO L124 PetriNetUnfolderBase]: 208/375 cut-off events. [2024-06-14 14:23:19,907 INFO L125 PetriNetUnfolderBase]: For 1767/1767 co-relation queries the response was YES. [2024-06-14 14:23:19,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 375 events. 208/375 cut-off events. For 1767/1767 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1295 event pairs, 66 based on Foata normal form. 1/375 useless extension candidates. Maximal degree in co-relation 1404. Up to 345 conditions per place. [2024-06-14 14:23:19,910 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 40 selfloop transitions, 13 changer transitions 0/55 dead transitions. [2024-06-14 14:23:19,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 383 flow [2024-06-14 14:23:19,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:23:19,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:23:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2024-06-14 14:23:19,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 14:23:19,912 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 239 flow. Second operand 7 states and 91 transitions. [2024-06-14 14:23:19,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 383 flow [2024-06-14 14:23:19,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 358 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-14 14:23:19,915 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 263 flow [2024-06-14 14:23:19,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=263, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2024-06-14 14:23:19,917 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 27 predicate places. [2024-06-14 14:23:19,917 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 263 flow [2024-06-14 14:23:19,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:19,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:19,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:19,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 14:23:19,918 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:19,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:19,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1965164677, now seen corresponding path program 1 times [2024-06-14 14:23:19,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:19,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368766912] [2024-06-14 14:23:19,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:19,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:24,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:24,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:24,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368766912] [2024-06-14 14:23:24,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368766912] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:24,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:24,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:23:24,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617626854] [2024-06-14 14:23:24,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:24,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:23:24,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:24,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:23:24,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:23:24,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:23:24,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 263 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:24,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:24,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:23:24,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:24,773 INFO L124 PetriNetUnfolderBase]: 227/406 cut-off events. [2024-06-14 14:23:24,773 INFO L125 PetriNetUnfolderBase]: For 2330/2330 co-relation queries the response was YES. [2024-06-14 14:23:24,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 406 events. 227/406 cut-off events. For 2330/2330 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1417 event pairs, 69 based on Foata normal form. 3/408 useless extension candidates. Maximal degree in co-relation 1557. Up to 351 conditions per place. [2024-06-14 14:23:24,777 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 49 selfloop transitions, 15 changer transitions 0/66 dead transitions. [2024-06-14 14:23:24,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 471 flow [2024-06-14 14:23:24,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:23:24,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:23:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2024-06-14 14:23:24,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 14:23:24,782 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 263 flow. Second operand 7 states and 91 transitions. [2024-06-14 14:23:24,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 471 flow [2024-06-14 14:23:24,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 444 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-14 14:23:24,795 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 310 flow [2024-06-14 14:23:24,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=310, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-06-14 14:23:24,796 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 30 predicate places. [2024-06-14 14:23:24,797 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 310 flow [2024-06-14 14:23:24,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:24,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:24,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:24,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 14:23:24,797 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:24,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:24,798 INFO L85 PathProgramCache]: Analyzing trace with hash 505317578, now seen corresponding path program 3 times [2024-06-14 14:23:24,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:24,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6176669] [2024-06-14 14:23:24,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:30,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:30,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6176669] [2024-06-14 14:23:30,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6176669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:30,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:30,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:23:30,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830060821] [2024-06-14 14:23:30,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:30,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:23:30,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:30,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:23:30,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:23:30,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:23:30,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 310 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:30,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:30,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:23:30,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:30,521 INFO L124 PetriNetUnfolderBase]: 225/403 cut-off events. [2024-06-14 14:23:30,522 INFO L125 PetriNetUnfolderBase]: For 2648/2648 co-relation queries the response was YES. [2024-06-14 14:23:30,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 403 events. 225/403 cut-off events. For 2648/2648 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1400 event pairs, 67 based on Foata normal form. 1/403 useless extension candidates. Maximal degree in co-relation 1660. Up to 385 conditions per place. [2024-06-14 14:23:30,524 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 46 selfloop transitions, 10 changer transitions 0/58 dead transitions. [2024-06-14 14:23:30,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 58 transitions, 438 flow [2024-06-14 14:23:30,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:23:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:23:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-14 14:23:30,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35267857142857145 [2024-06-14 14:23:30,526 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 310 flow. Second operand 7 states and 79 transitions. [2024-06-14 14:23:30,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 58 transitions, 438 flow [2024-06-14 14:23:30,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 58 transitions, 425 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-14 14:23:30,529 INFO L231 Difference]: Finished difference. Result has 66 places, 51 transitions, 322 flow [2024-06-14 14:23:30,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=322, PETRI_PLACES=66, PETRI_TRANSITIONS=51} [2024-06-14 14:23:30,530 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2024-06-14 14:23:30,530 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 322 flow [2024-06-14 14:23:30,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:30,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:30,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:30,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 14:23:30,530 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:30,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:30,531 INFO L85 PathProgramCache]: Analyzing trace with hash -408967995, now seen corresponding path program 2 times [2024-06-14 14:23:30,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:30,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920869863] [2024-06-14 14:23:30,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:30,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:34,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 14:23:34,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:34,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920869863] [2024-06-14 14:23:34,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920869863] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:34,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:34,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:23:34,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919627553] [2024-06-14 14:23:34,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:34,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:23:34,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:34,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:23:34,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:23:34,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:23:34,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 51 transitions, 322 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:34,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:34,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:23:34,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:34,822 INFO L124 PetriNetUnfolderBase]: 234/418 cut-off events. [2024-06-14 14:23:34,823 INFO L125 PetriNetUnfolderBase]: For 3282/3282 co-relation queries the response was YES. [2024-06-14 14:23:34,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1791 conditions, 418 events. 234/418 cut-off events. For 3282/3282 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1482 event pairs, 67 based on Foata normal form. 3/420 useless extension candidates. Maximal degree in co-relation 1757. Up to 377 conditions per place. [2024-06-14 14:23:34,825 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 50 selfloop transitions, 13 changer transitions 0/65 dead transitions. [2024-06-14 14:23:34,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 516 flow [2024-06-14 14:23:34,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 14:23:34,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 14:23:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-14 14:23:34,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38392857142857145 [2024-06-14 14:23:34,829 INFO L175 Difference]: Start difference. First operand has 66 places, 51 transitions, 322 flow. Second operand 7 states and 86 transitions. [2024-06-14 14:23:34,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 516 flow [2024-06-14 14:23:34,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 65 transitions, 481 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 14:23:34,833 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 332 flow [2024-06-14 14:23:34,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=332, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2024-06-14 14:23:34,833 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2024-06-14 14:23:34,833 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 332 flow [2024-06-14 14:23:34,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:34,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:34,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:34,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 14:23:34,834 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:34,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:34,836 INFO L85 PathProgramCache]: Analyzing trace with hash -408701085, now seen corresponding path program 3 times [2024-06-14 14:23:34,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:34,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002676879] [2024-06-14 14:23:34,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:34,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:38,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:38,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:38,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002676879] [2024-06-14 14:23:38,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002676879] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:38,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:38,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 14:23:38,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665432802] [2024-06-14 14:23:38,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:38,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 14:23:38,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:38,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 14:23:38,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 14:23:38,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:23:38,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 332 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:38,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:38,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:23:38,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:39,209 INFO L124 PetriNetUnfolderBase]: 228/409 cut-off events. [2024-06-14 14:23:39,209 INFO L125 PetriNetUnfolderBase]: For 3560/3560 co-relation queries the response was YES. [2024-06-14 14:23:39,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1762 conditions, 409 events. 228/409 cut-off events. For 3560/3560 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1440 event pairs, 65 based on Foata normal form. 3/411 useless extension candidates. Maximal degree in co-relation 1728. Up to 385 conditions per place. [2024-06-14 14:23:39,212 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 49 selfloop transitions, 12 changer transitions 0/63 dead transitions. [2024-06-14 14:23:39,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 63 transitions, 487 flow [2024-06-14 14:23:39,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:23:39,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:23:39,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-14 14:23:39,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 14:23:39,214 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 332 flow. Second operand 8 states and 88 transitions. [2024-06-14 14:23:39,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 63 transitions, 487 flow [2024-06-14 14:23:39,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 63 transitions, 445 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-14 14:23:39,218 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 337 flow [2024-06-14 14:23:39,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=337, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2024-06-14 14:23:39,219 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 39 predicate places. [2024-06-14 14:23:39,219 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 337 flow [2024-06-14 14:23:39,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:39,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:39,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:39,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 14:23:39,219 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:39,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:39,220 INFO L85 PathProgramCache]: Analyzing trace with hash -21190711, now seen corresponding path program 1 times [2024-06-14 14:23:39,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:39,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054210211] [2024-06-14 14:23:39,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:39,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:44,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:44,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054210211] [2024-06-14 14:23:44,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054210211] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:44,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:44,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:23:44,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920175353] [2024-06-14 14:23:44,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:44,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:23:44,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:44,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:23:44,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:23:44,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:23:44,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 337 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:44,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:44,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:23:44,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:44,976 INFO L124 PetriNetUnfolderBase]: 231/414 cut-off events. [2024-06-14 14:23:44,976 INFO L125 PetriNetUnfolderBase]: For 3776/3776 co-relation queries the response was YES. [2024-06-14 14:23:44,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 414 events. 231/414 cut-off events. For 3776/3776 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1471 event pairs, 46 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1764. Up to 375 conditions per place. [2024-06-14 14:23:44,978 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 60 selfloop transitions, 13 changer transitions 0/75 dead transitions. [2024-06-14 14:23:44,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 75 transitions, 545 flow [2024-06-14 14:23:44,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:23:44,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:23:44,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-14 14:23:44,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37890625 [2024-06-14 14:23:44,980 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 337 flow. Second operand 8 states and 97 transitions. [2024-06-14 14:23:44,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 75 transitions, 545 flow [2024-06-14 14:23:44,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 75 transitions, 517 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-14 14:23:44,985 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 365 flow [2024-06-14 14:23:44,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=365, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2024-06-14 14:23:44,985 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 42 predicate places. [2024-06-14 14:23:44,985 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 365 flow [2024-06-14 14:23:44,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:44,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:44,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:44,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 14:23:44,986 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:44,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:44,986 INFO L85 PathProgramCache]: Analyzing trace with hash -21185875, now seen corresponding path program 1 times [2024-06-14 14:23:44,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:44,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572273116] [2024-06-14 14:23:44,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:44,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:50,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:50,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:50,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572273116] [2024-06-14 14:23:50,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572273116] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:50,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:50,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:23:50,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896212901] [2024-06-14 14:23:50,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:50,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:23:50,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:50,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:23:50,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:23:50,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:23:50,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 365 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:50,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:50,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:23:50,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:51,272 INFO L124 PetriNetUnfolderBase]: 244/435 cut-off events. [2024-06-14 14:23:51,272 INFO L125 PetriNetUnfolderBase]: For 4479/4479 co-relation queries the response was YES. [2024-06-14 14:23:51,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1968 conditions, 435 events. 244/435 cut-off events. For 4479/4479 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1574 event pairs, 46 based on Foata normal form. 1/435 useless extension candidates. Maximal degree in co-relation 1931. Up to 303 conditions per place. [2024-06-14 14:23:51,275 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 53 selfloop transitions, 30 changer transitions 0/85 dead transitions. [2024-06-14 14:23:51,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 85 transitions, 677 flow [2024-06-14 14:23:51,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:23:51,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:23:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-14 14:23:51,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2024-06-14 14:23:51,277 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 365 flow. Second operand 8 states and 108 transitions. [2024-06-14 14:23:51,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 85 transitions, 677 flow [2024-06-14 14:23:51,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 85 transitions, 658 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 14:23:51,283 INFO L231 Difference]: Finished difference. Result has 79 places, 66 transitions, 487 flow [2024-06-14 14:23:51,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=487, PETRI_PLACES=79, PETRI_TRANSITIONS=66} [2024-06-14 14:23:51,283 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 48 predicate places. [2024-06-14 14:23:51,284 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 66 transitions, 487 flow [2024-06-14 14:23:51,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:51,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:51,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:51,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 14:23:51,285 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:51,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:51,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2018047671, now seen corresponding path program 2 times [2024-06-14 14:23:51,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:51,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401602533] [2024-06-14 14:23:51,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:51,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:23:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:23:56,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:23:56,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401602533] [2024-06-14 14:23:56,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401602533] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:23:56,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:23:56,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:23:56,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595910154] [2024-06-14 14:23:56,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:23:56,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:23:56,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:23:56,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:23:56,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:23:56,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:23:56,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 66 transitions, 487 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:56,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:23:56,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:23:56,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:23:56,956 INFO L124 PetriNetUnfolderBase]: 255/453 cut-off events. [2024-06-14 14:23:56,956 INFO L125 PetriNetUnfolderBase]: For 5602/5602 co-relation queries the response was YES. [2024-06-14 14:23:56,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2312 conditions, 453 events. 255/453 cut-off events. For 5602/5602 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1668 event pairs, 49 based on Foata normal form. 2/454 useless extension candidates. Maximal degree in co-relation 2271. Up to 364 conditions per place. [2024-06-14 14:23:56,959 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 61 selfloop transitions, 26 changer transitions 0/89 dead transitions. [2024-06-14 14:23:56,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 89 transitions, 815 flow [2024-06-14 14:23:56,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:23:56,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:23:56,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-14 14:23:56,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 14:23:56,961 INFO L175 Difference]: Start difference. First operand has 79 places, 66 transitions, 487 flow. Second operand 8 states and 104 transitions. [2024-06-14 14:23:56,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 89 transitions, 815 flow [2024-06-14 14:23:56,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 89 transitions, 795 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-14 14:23:56,967 INFO L231 Difference]: Finished difference. Result has 84 places, 72 transitions, 570 flow [2024-06-14 14:23:56,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=570, PETRI_PLACES=84, PETRI_TRANSITIONS=72} [2024-06-14 14:23:56,968 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 53 predicate places. [2024-06-14 14:23:56,968 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 72 transitions, 570 flow [2024-06-14 14:23:56,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:23:56,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:23:56,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:23:56,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 14:23:56,969 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:23:56,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:23:56,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2022689487, now seen corresponding path program 2 times [2024-06-14 14:23:56,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:23:56,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650946791] [2024-06-14 14:23:56,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:23:56,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:23:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:02,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:02,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:02,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650946791] [2024-06-14 14:24:02,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650946791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:02,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:02,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:24:02,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818741054] [2024-06-14 14:24:02,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:02,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:24:02,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:02,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:24:02,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:24:02,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:24:02,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 570 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:02,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:02,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:24:02,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:03,069 INFO L124 PetriNetUnfolderBase]: 273/482 cut-off events. [2024-06-14 14:24:03,069 INFO L125 PetriNetUnfolderBase]: For 6615/6615 co-relation queries the response was YES. [2024-06-14 14:24:03,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2592 conditions, 482 events. 273/482 cut-off events. For 6615/6615 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1811 event pairs, 47 based on Foata normal form. 1/482 useless extension candidates. Maximal degree in co-relation 2549. Up to 387 conditions per place. [2024-06-14 14:24:03,073 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 66 selfloop transitions, 27 changer transitions 0/95 dead transitions. [2024-06-14 14:24:03,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 95 transitions, 909 flow [2024-06-14 14:24:03,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:24:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:24:03,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-14 14:24:03,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2024-06-14 14:24:03,074 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 570 flow. Second operand 8 states and 107 transitions. [2024-06-14 14:24:03,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 95 transitions, 909 flow [2024-06-14 14:24:03,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 95 transitions, 880 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 14:24:03,081 INFO L231 Difference]: Finished difference. Result has 90 places, 77 transitions, 644 flow [2024-06-14 14:24:03,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=644, PETRI_PLACES=90, PETRI_TRANSITIONS=77} [2024-06-14 14:24:03,081 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 59 predicate places. [2024-06-14 14:24:03,081 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 77 transitions, 644 flow [2024-06-14 14:24:03,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:03,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:03,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:03,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 14:24:03,082 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:24:03,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:03,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1621015537, now seen corresponding path program 3 times [2024-06-14 14:24:03,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:03,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804873051] [2024-06-14 14:24:03,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:03,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:08,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:08,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:08,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804873051] [2024-06-14 14:24:08,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804873051] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:08,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:08,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:24:08,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094286225] [2024-06-14 14:24:08,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:08,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:24:08,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:08,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:24:08,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:24:08,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:24:08,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 77 transitions, 644 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:08,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:08,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:24:08,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:09,177 INFO L124 PetriNetUnfolderBase]: 267/473 cut-off events. [2024-06-14 14:24:09,177 INFO L125 PetriNetUnfolderBase]: For 7240/7240 co-relation queries the response was YES. [2024-06-14 14:24:09,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2626 conditions, 473 events. 267/473 cut-off events. For 7240/7240 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1765 event pairs, 47 based on Foata normal form. 3/475 useless extension candidates. Maximal degree in co-relation 2580. Up to 388 conditions per place. [2024-06-14 14:24:09,181 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 68 selfloop transitions, 24 changer transitions 0/94 dead transitions. [2024-06-14 14:24:09,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 94 transitions, 916 flow [2024-06-14 14:24:09,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:24:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:24:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-14 14:24:09,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 14:24:09,182 INFO L175 Difference]: Start difference. First operand has 90 places, 77 transitions, 644 flow. Second operand 8 states and 104 transitions. [2024-06-14 14:24:09,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 94 transitions, 916 flow [2024-06-14 14:24:09,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 883 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 14:24:09,194 INFO L231 Difference]: Finished difference. Result has 94 places, 77 transitions, 665 flow [2024-06-14 14:24:09,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=665, PETRI_PLACES=94, PETRI_TRANSITIONS=77} [2024-06-14 14:24:09,195 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 63 predicate places. [2024-06-14 14:24:09,195 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 77 transitions, 665 flow [2024-06-14 14:24:09,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:09,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:09,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:09,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 14:24:09,196 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:24:09,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:09,196 INFO L85 PathProgramCache]: Analyzing trace with hash -23986311, now seen corresponding path program 3 times [2024-06-14 14:24:09,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:09,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187052283] [2024-06-14 14:24:09,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:09,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:14,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:14,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187052283] [2024-06-14 14:24:14,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187052283] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:14,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:14,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:24:14,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614543502] [2024-06-14 14:24:14,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:14,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:24:14,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:14,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:24:14,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:24:14,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:24:14,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 77 transitions, 665 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:14,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:14,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:24:14,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:14,421 INFO L124 PetriNetUnfolderBase]: 270/478 cut-off events. [2024-06-14 14:24:14,422 INFO L125 PetriNetUnfolderBase]: For 7636/7636 co-relation queries the response was YES. [2024-06-14 14:24:14,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2748 conditions, 478 events. 270/478 cut-off events. For 7636/7636 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1788 event pairs, 53 based on Foata normal form. 1/478 useless extension candidates. Maximal degree in co-relation 2700. Up to 445 conditions per place. [2024-06-14 14:24:14,425 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 71 selfloop transitions, 16 changer transitions 0/89 dead transitions. [2024-06-14 14:24:14,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 89 transitions, 879 flow [2024-06-14 14:24:14,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:24:14,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:24:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-14 14:24:14,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36328125 [2024-06-14 14:24:14,427 INFO L175 Difference]: Start difference. First operand has 94 places, 77 transitions, 665 flow. Second operand 8 states and 93 transitions. [2024-06-14 14:24:14,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 89 transitions, 879 flow [2024-06-14 14:24:14,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 89 transitions, 826 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 14:24:14,436 INFO L231 Difference]: Finished difference. Result has 95 places, 79 transitions, 667 flow [2024-06-14 14:24:14,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=667, PETRI_PLACES=95, PETRI_TRANSITIONS=79} [2024-06-14 14:24:14,436 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 64 predicate places. [2024-06-14 14:24:14,436 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 79 transitions, 667 flow [2024-06-14 14:24:14,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:14,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:14,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:14,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 14:24:14,437 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:24:14,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:14,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1506445689, now seen corresponding path program 1 times [2024-06-14 14:24:14,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:14,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704429048] [2024-06-14 14:24:14,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:14,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:18,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:18,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:18,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704429048] [2024-06-14 14:24:18,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704429048] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:18,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:18,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:24:18,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733388287] [2024-06-14 14:24:18,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:18,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:24:18,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:18,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:24:18,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:24:18,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:24:18,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 79 transitions, 667 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:18,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:18,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:24:18,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:19,267 INFO L124 PetriNetUnfolderBase]: 266/472 cut-off events. [2024-06-14 14:24:19,267 INFO L125 PetriNetUnfolderBase]: For 8134/8134 co-relation queries the response was YES. [2024-06-14 14:24:19,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2701 conditions, 472 events. 266/472 cut-off events. For 8134/8134 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1754 event pairs, 47 based on Foata normal form. 2/473 useless extension candidates. Maximal degree in co-relation 2652. Up to 443 conditions per place. [2024-06-14 14:24:19,271 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 73 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2024-06-14 14:24:19,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 88 transitions, 859 flow [2024-06-14 14:24:19,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:24:19,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:24:19,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2024-06-14 14:24:19,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515625 [2024-06-14 14:24:19,272 INFO L175 Difference]: Start difference. First operand has 95 places, 79 transitions, 667 flow. Second operand 8 states and 90 transitions. [2024-06-14 14:24:19,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 88 transitions, 859 flow [2024-06-14 14:24:19,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 88 transitions, 820 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 14:24:19,280 INFO L231 Difference]: Finished difference. Result has 97 places, 79 transitions, 659 flow [2024-06-14 14:24:19,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=659, PETRI_PLACES=97, PETRI_TRANSITIONS=79} [2024-06-14 14:24:19,281 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 66 predicate places. [2024-06-14 14:24:19,281 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 79 transitions, 659 flow [2024-06-14 14:24:19,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:19,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:19,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:19,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 14:24:19,281 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:24:19,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:19,282 INFO L85 PathProgramCache]: Analyzing trace with hash -385606735, now seen corresponding path program 4 times [2024-06-14 14:24:19,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:19,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189104888] [2024-06-14 14:24:19,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:19,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:24,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 14:24:24,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:24,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189104888] [2024-06-14 14:24:24,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189104888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:24,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:24,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:24:24,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645430576] [2024-06-14 14:24:24,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:24,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:24:24,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:24,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:24:24,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:24:24,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:24:24,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 79 transitions, 659 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:24,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:24,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:24:24,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:25,067 INFO L124 PetriNetUnfolderBase]: 279/493 cut-off events. [2024-06-14 14:24:25,067 INFO L125 PetriNetUnfolderBase]: For 9068/9068 co-relation queries the response was YES. [2024-06-14 14:24:25,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2865 conditions, 493 events. 279/493 cut-off events. For 9068/9068 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1854 event pairs, 49 based on Foata normal form. 1/493 useless extension candidates. Maximal degree in co-relation 2815. Up to 430 conditions per place. [2024-06-14 14:24:25,071 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 72 selfloop transitions, 20 changer transitions 0/94 dead transitions. [2024-06-14 14:24:25,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 94 transitions, 949 flow [2024-06-14 14:24:25,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:24:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:24:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-14 14:24:25,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 14:24:25,073 INFO L175 Difference]: Start difference. First operand has 97 places, 79 transitions, 659 flow. Second operand 8 states and 96 transitions. [2024-06-14 14:24:25,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 94 transitions, 949 flow [2024-06-14 14:24:25,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 901 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 14:24:25,085 INFO L231 Difference]: Finished difference. Result has 99 places, 83 transitions, 702 flow [2024-06-14 14:24:25,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=702, PETRI_PLACES=99, PETRI_TRANSITIONS=83} [2024-06-14 14:24:25,086 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 68 predicate places. [2024-06-14 14:24:25,086 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 83 transitions, 702 flow [2024-06-14 14:24:25,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:25,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:25,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:25,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 14:24:25,087 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:24:25,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:25,088 INFO L85 PathProgramCache]: Analyzing trace with hash 206894765, now seen corresponding path program 5 times [2024-06-14 14:24:25,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:25,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951774482] [2024-06-14 14:24:25,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:25,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:30,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:30,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951774482] [2024-06-14 14:24:30,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951774482] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:30,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:30,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:24:30,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644695341] [2024-06-14 14:24:30,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:30,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:24:30,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:30,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:24:30,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:24:30,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:24:30,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 83 transitions, 702 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:30,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:30,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:24:30,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:30,993 INFO L124 PetriNetUnfolderBase]: 288/508 cut-off events. [2024-06-14 14:24:30,993 INFO L125 PetriNetUnfolderBase]: For 10495/10495 co-relation queries the response was YES. [2024-06-14 14:24:30,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3025 conditions, 508 events. 288/508 cut-off events. For 10495/10495 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1931 event pairs, 45 based on Foata normal form. 3/510 useless extension candidates. Maximal degree in co-relation 2973. Up to 447 conditions per place. [2024-06-14 14:24:30,996 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 77 selfloop transitions, 20 changer transitions 0/99 dead transitions. [2024-06-14 14:24:30,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 970 flow [2024-06-14 14:24:30,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:24:30,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:24:30,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-14 14:24:30,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3828125 [2024-06-14 14:24:30,998 INFO L175 Difference]: Start difference. First operand has 99 places, 83 transitions, 702 flow. Second operand 8 states and 98 transitions. [2024-06-14 14:24:30,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 970 flow [2024-06-14 14:24:31,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 99 transitions, 935 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-14 14:24:31,009 INFO L231 Difference]: Finished difference. Result has 103 places, 86 transitions, 753 flow [2024-06-14 14:24:31,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=753, PETRI_PLACES=103, PETRI_TRANSITIONS=86} [2024-06-14 14:24:31,010 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 72 predicate places. [2024-06-14 14:24:31,010 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 86 transitions, 753 flow [2024-06-14 14:24:31,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:31,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:31,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:31,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 14:24:31,011 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:24:31,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:31,011 INFO L85 PathProgramCache]: Analyzing trace with hash 206888069, now seen corresponding path program 4 times [2024-06-14 14:24:31,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:31,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608908264] [2024-06-14 14:24:31,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:31,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:35,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:35,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:35,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608908264] [2024-06-14 14:24:35,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608908264] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:35,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:35,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:24:35,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669268775] [2024-06-14 14:24:35,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:35,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:24:35,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:35,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:24:35,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:24:35,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:24:35,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 86 transitions, 753 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:35,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:35,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:24:35,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:36,099 INFO L124 PetriNetUnfolderBase]: 289/510 cut-off events. [2024-06-14 14:24:36,100 INFO L125 PetriNetUnfolderBase]: For 10876/10876 co-relation queries the response was YES. [2024-06-14 14:24:36,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3094 conditions, 510 events. 289/510 cut-off events. For 10876/10876 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1938 event pairs, 54 based on Foata normal form. 2/511 useless extension candidates. Maximal degree in co-relation 3040. Up to 486 conditions per place. [2024-06-14 14:24:36,104 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 81 selfloop transitions, 13 changer transitions 0/96 dead transitions. [2024-06-14 14:24:36,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 96 transitions, 981 flow [2024-06-14 14:24:36,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:24:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:24:36,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-14 14:24:36,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34765625 [2024-06-14 14:24:36,109 INFO L175 Difference]: Start difference. First operand has 103 places, 86 transitions, 753 flow. Second operand 8 states and 89 transitions. [2024-06-14 14:24:36,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 96 transitions, 981 flow [2024-06-14 14:24:36,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 96 transitions, 941 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 14:24:36,121 INFO L231 Difference]: Finished difference. Result has 105 places, 88 transitions, 766 flow [2024-06-14 14:24:36,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=766, PETRI_PLACES=105, PETRI_TRANSITIONS=88} [2024-06-14 14:24:36,121 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 74 predicate places. [2024-06-14 14:24:36,121 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 88 transitions, 766 flow [2024-06-14 14:24:36,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:36,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:36,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:36,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 14:24:36,122 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:24:36,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:36,122 INFO L85 PathProgramCache]: Analyzing trace with hash 215168975, now seen corresponding path program 6 times [2024-06-14 14:24:36,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:36,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453750871] [2024-06-14 14:24:36,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:36,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:41,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:41,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:41,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453750871] [2024-06-14 14:24:41,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453750871] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:41,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:41,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:24:41,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021703563] [2024-06-14 14:24:41,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:41,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:24:41,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:41,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:24:41,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:24:41,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:24:41,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 88 transitions, 766 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:41,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:41,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:24:41,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:41,552 INFO L124 PetriNetUnfolderBase]: 279/495 cut-off events. [2024-06-14 14:24:41,552 INFO L125 PetriNetUnfolderBase]: For 11174/11174 co-relation queries the response was YES. [2024-06-14 14:24:41,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2920 conditions, 495 events. 279/495 cut-off events. For 11174/11174 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1888 event pairs, 46 based on Foata normal form. 5/499 useless extension candidates. Maximal degree in co-relation 2865. Up to 438 conditions per place. [2024-06-14 14:24:41,556 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 78 selfloop transitions, 19 changer transitions 0/99 dead transitions. [2024-06-14 14:24:41,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 99 transitions, 990 flow [2024-06-14 14:24:41,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:24:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:24:41,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-14 14:24:41,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-14 14:24:41,557 INFO L175 Difference]: Start difference. First operand has 105 places, 88 transitions, 766 flow. Second operand 8 states and 94 transitions. [2024-06-14 14:24:41,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 99 transitions, 990 flow [2024-06-14 14:24:41,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 99 transitions, 955 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-14 14:24:41,567 INFO L231 Difference]: Finished difference. Result has 107 places, 88 transitions, 778 flow [2024-06-14 14:24:41,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=778, PETRI_PLACES=107, PETRI_TRANSITIONS=88} [2024-06-14 14:24:41,568 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 76 predicate places. [2024-06-14 14:24:41,568 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 88 transitions, 778 flow [2024-06-14 14:24:41,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:41,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:41,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:41,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 14:24:41,569 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:24:41,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:41,569 INFO L85 PathProgramCache]: Analyzing trace with hash 215476805, now seen corresponding path program 1 times [2024-06-14 14:24:41,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:41,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371888111] [2024-06-14 14:24:41,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:41,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:46,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:46,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371888111] [2024-06-14 14:24:46,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371888111] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:46,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:46,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:24:46,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718988422] [2024-06-14 14:24:46,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:46,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:24:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:46,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:24:46,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:24:46,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:24:46,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 88 transitions, 778 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:46,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:46,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:24:46,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:46,806 INFO L124 PetriNetUnfolderBase]: 276/490 cut-off events. [2024-06-14 14:24:46,806 INFO L125 PetriNetUnfolderBase]: For 10619/10619 co-relation queries the response was YES. [2024-06-14 14:24:46,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2911 conditions, 490 events. 276/490 cut-off events. For 10619/10619 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1834 event pairs, 47 based on Foata normal form. 2/491 useless extension candidates. Maximal degree in co-relation 2855. Up to 463 conditions per place. [2024-06-14 14:24:46,810 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 83 selfloop transitions, 12 changer transitions 0/97 dead transitions. [2024-06-14 14:24:46,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 97 transitions, 988 flow [2024-06-14 14:24:46,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:24:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:24:46,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-14 14:24:46,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 14:24:46,811 INFO L175 Difference]: Start difference. First operand has 107 places, 88 transitions, 778 flow. Second operand 8 states and 88 transitions. [2024-06-14 14:24:46,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 97 transitions, 988 flow [2024-06-14 14:24:46,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 97 transitions, 893 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-14 14:24:46,822 INFO L231 Difference]: Finished difference. Result has 106 places, 88 transitions, 711 flow [2024-06-14 14:24:46,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=711, PETRI_PLACES=106, PETRI_TRANSITIONS=88} [2024-06-14 14:24:46,823 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 75 predicate places. [2024-06-14 14:24:46,823 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 88 transitions, 711 flow [2024-06-14 14:24:46,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:46,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:46,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:46,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 14:24:46,823 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:24:46,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:46,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1406578453, now seen corresponding path program 1 times [2024-06-14 14:24:46,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:46,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837114255] [2024-06-14 14:24:46,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:46,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:52,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:52,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837114255] [2024-06-14 14:24:52,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837114255] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:52,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:52,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:24:52,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981777116] [2024-06-14 14:24:52,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:52,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:24:52,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:52,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:24:52,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:24:53,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:24:53,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 88 transitions, 711 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:53,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:53,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:24:53,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:24:53,540 INFO L124 PetriNetUnfolderBase]: 274/487 cut-off events. [2024-06-14 14:24:53,540 INFO L125 PetriNetUnfolderBase]: For 10618/10618 co-relation queries the response was YES. [2024-06-14 14:24:53,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2772 conditions, 487 events. 274/487 cut-off events. For 10618/10618 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1834 event pairs, 50 based on Foata normal form. 1/487 useless extension candidates. Maximal degree in co-relation 2717. Up to 434 conditions per place. [2024-06-14 14:24:53,544 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 87 selfloop transitions, 15 changer transitions 0/104 dead transitions. [2024-06-14 14:24:53,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 104 transitions, 961 flow [2024-06-14 14:24:53,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:24:53,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:24:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-14 14:24:53,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38671875 [2024-06-14 14:24:53,545 INFO L175 Difference]: Start difference. First operand has 106 places, 88 transitions, 711 flow. Second operand 8 states and 99 transitions. [2024-06-14 14:24:53,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 104 transitions, 961 flow [2024-06-14 14:24:53,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 104 transitions, 929 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-14 14:24:53,558 INFO L231 Difference]: Finished difference. Result has 108 places, 88 transitions, 716 flow [2024-06-14 14:24:53,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=716, PETRI_PLACES=108, PETRI_TRANSITIONS=88} [2024-06-14 14:24:53,559 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 77 predicate places. [2024-06-14 14:24:53,559 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 88 transitions, 716 flow [2024-06-14 14:24:53,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:53,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:24:53,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:24:53,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 14:24:53,560 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:24:53,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:24:53,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1410149498, now seen corresponding path program 1 times [2024-06-14 14:24:53,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:24:53,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888499758] [2024-06-14 14:24:53,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:24:53,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:24:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:24:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:24:59,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:24:59,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888499758] [2024-06-14 14:24:59,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888499758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:24:59,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:24:59,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:24:59,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432104568] [2024-06-14 14:24:59,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:24:59,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:24:59,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:24:59,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:24:59,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:24:59,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:24:59,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 88 transitions, 716 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:24:59,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:24:59,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:24:59,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:00,208 INFO L124 PetriNetUnfolderBase]: 277/492 cut-off events. [2024-06-14 14:25:00,209 INFO L125 PetriNetUnfolderBase]: For 11383/11383 co-relation queries the response was YES. [2024-06-14 14:25:00,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2825 conditions, 492 events. 277/492 cut-off events. For 11383/11383 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1867 event pairs, 49 based on Foata normal form. 1/492 useless extension candidates. Maximal degree in co-relation 2769. Up to 450 conditions per place. [2024-06-14 14:25:00,212 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 90 selfloop transitions, 15 changer transitions 0/107 dead transitions. [2024-06-14 14:25:00,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 107 transitions, 988 flow [2024-06-14 14:25:00,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:25:00,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:25:00,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 14:25:00,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2024-06-14 14:25:00,213 INFO L175 Difference]: Start difference. First operand has 108 places, 88 transitions, 716 flow. Second operand 9 states and 106 transitions. [2024-06-14 14:25:00,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 107 transitions, 988 flow [2024-06-14 14:25:00,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 953 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 14:25:00,225 INFO L231 Difference]: Finished difference. Result has 110 places, 90 transitions, 734 flow [2024-06-14 14:25:00,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=734, PETRI_PLACES=110, PETRI_TRANSITIONS=90} [2024-06-14 14:25:00,226 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 79 predicate places. [2024-06-14 14:25:00,226 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 90 transitions, 734 flow [2024-06-14 14:25:00,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:00,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:00,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:00,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 14:25:00,226 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:25:00,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:00,227 INFO L85 PathProgramCache]: Analyzing trace with hash -656761372, now seen corresponding path program 2 times [2024-06-14 14:25:00,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:00,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952709822] [2024-06-14 14:25:00,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:00,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:05,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:05,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952709822] [2024-06-14 14:25:05,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952709822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:05,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:05,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:25:05,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315251381] [2024-06-14 14:25:05,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:05,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:25:05,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:05,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:25:05,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:25:05,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:25:05,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 90 transitions, 734 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:05,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:05,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:25:05,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:06,040 INFO L124 PetriNetUnfolderBase]: 313/550 cut-off events. [2024-06-14 14:25:06,041 INFO L125 PetriNetUnfolderBase]: For 14844/14844 co-relation queries the response was YES. [2024-06-14 14:25:06,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3289 conditions, 550 events. 313/550 cut-off events. For 14844/14844 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2159 event pairs, 47 based on Foata normal form. 2/551 useless extension candidates. Maximal degree in co-relation 3232. Up to 306 conditions per place. [2024-06-14 14:25:06,045 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 72 selfloop transitions, 46 changer transitions 0/120 dead transitions. [2024-06-14 14:25:06,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 120 transitions, 1226 flow [2024-06-14 14:25:06,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:25:06,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:25:06,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-14 14:25:06,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2024-06-14 14:25:06,046 INFO L175 Difference]: Start difference. First operand has 110 places, 90 transitions, 734 flow. Second operand 9 states and 122 transitions. [2024-06-14 14:25:06,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 120 transitions, 1226 flow [2024-06-14 14:25:06,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 120 transitions, 1189 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 14:25:06,061 INFO L231 Difference]: Finished difference. Result has 113 places, 98 transitions, 891 flow [2024-06-14 14:25:06,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=891, PETRI_PLACES=113, PETRI_TRANSITIONS=98} [2024-06-14 14:25:06,062 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 82 predicate places. [2024-06-14 14:25:06,062 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 98 transitions, 891 flow [2024-06-14 14:25:06,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:06,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:06,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 14:25:06,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 14:25:06,063 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:25:06,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:06,063 INFO L85 PathProgramCache]: Analyzing trace with hash -656761155, now seen corresponding path program 1 times [2024-06-14 14:25:06,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:06,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265339854] [2024-06-14 14:25:06,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:06,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:12,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:12,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265339854] [2024-06-14 14:25:12,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265339854] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:12,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:12,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:25:12,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590982776] [2024-06-14 14:25:12,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:12,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:25:12,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:12,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:25:12,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:25:12,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:25:12,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 98 transitions, 891 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:12,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:12,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:25:12,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:12,993 INFO L124 PetriNetUnfolderBase]: 319/560 cut-off events. [2024-06-14 14:25:12,994 INFO L125 PetriNetUnfolderBase]: For 16425/16425 co-relation queries the response was YES. [2024-06-14 14:25:12,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3548 conditions, 560 events. 319/560 cut-off events. For 16425/16425 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2214 event pairs, 51 based on Foata normal form. 2/561 useless extension candidates. Maximal degree in co-relation 3489. Up to 420 conditions per place. [2024-06-14 14:25:12,997 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 82 selfloop transitions, 36 changer transitions 0/120 dead transitions. [2024-06-14 14:25:12,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 120 transitions, 1263 flow [2024-06-14 14:25:12,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:25:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:25:12,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-14 14:25:12,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3993055555555556 [2024-06-14 14:25:12,999 INFO L175 Difference]: Start difference. First operand has 113 places, 98 transitions, 891 flow. Second operand 9 states and 115 transitions. [2024-06-14 14:25:12,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 120 transitions, 1263 flow [2024-06-14 14:25:13,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 120 transitions, 1210 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-14 14:25:13,018 INFO L231 Difference]: Finished difference. Result has 118 places, 102 transitions, 951 flow [2024-06-14 14:25:13,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=951, PETRI_PLACES=118, PETRI_TRANSITIONS=102} [2024-06-14 14:25:13,019 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 87 predicate places. [2024-06-14 14:25:13,019 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 102 transitions, 951 flow [2024-06-14 14:25:13,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:13,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:13,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:13,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 14:25:13,019 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:25:13,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:13,020 INFO L85 PathProgramCache]: Analyzing trace with hash -656766952, now seen corresponding path program 3 times [2024-06-14 14:25:13,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:13,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944016054] [2024-06-14 14:25:13,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:13,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:18,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:18,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:18,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944016054] [2024-06-14 14:25:18,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944016054] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:18,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:18,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:25:18,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99439622] [2024-06-14 14:25:18,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:18,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:25:18,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:18,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:25:18,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:25:18,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:25:18,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 102 transitions, 951 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:18,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:18,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:25:18,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:18,888 INFO L124 PetriNetUnfolderBase]: 320/562 cut-off events. [2024-06-14 14:25:18,888 INFO L125 PetriNetUnfolderBase]: For 17027/17027 co-relation queries the response was YES. [2024-06-14 14:25:18,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3602 conditions, 562 events. 320/562 cut-off events. For 17027/17027 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2237 event pairs, 46 based on Foata normal form. 2/563 useless extension candidates. Maximal degree in co-relation 3542. Up to 319 conditions per place. [2024-06-14 14:25:18,892 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 77 selfloop transitions, 46 changer transitions 0/125 dead transitions. [2024-06-14 14:25:18,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 125 transitions, 1401 flow [2024-06-14 14:25:18,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:25:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:25:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-14 14:25:18,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2024-06-14 14:25:18,893 INFO L175 Difference]: Start difference. First operand has 118 places, 102 transitions, 951 flow. Second operand 9 states and 123 transitions. [2024-06-14 14:25:18,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 125 transitions, 1401 flow [2024-06-14 14:25:18,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 125 transitions, 1360 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-14 14:25:18,914 INFO L231 Difference]: Finished difference. Result has 122 places, 104 transitions, 1021 flow [2024-06-14 14:25:18,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1021, PETRI_PLACES=122, PETRI_TRANSITIONS=104} [2024-06-14 14:25:18,914 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 91 predicate places. [2024-06-14 14:25:18,915 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 104 transitions, 1021 flow [2024-06-14 14:25:18,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:18,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:18,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:18,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 14:25:18,915 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:25:18,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:18,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1262332508, now seen corresponding path program 4 times [2024-06-14 14:25:18,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:18,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273418375] [2024-06-14 14:25:18,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:18,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:24,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:24,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273418375] [2024-06-14 14:25:24,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273418375] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:24,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:24,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:25:24,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140316499] [2024-06-14 14:25:24,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:24,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:25:24,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:24,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:25:24,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:25:24,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:25:24,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 104 transitions, 1021 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:24,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:24,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:25:24,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:25,067 INFO L124 PetriNetUnfolderBase]: 329/577 cut-off events. [2024-06-14 14:25:25,067 INFO L125 PetriNetUnfolderBase]: For 18920/18920 co-relation queries the response was YES. [2024-06-14 14:25:25,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3813 conditions, 577 events. 329/577 cut-off events. For 18920/18920 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2289 event pairs, 50 based on Foata normal form. 3/579 useless extension candidates. Maximal degree in co-relation 3751. Up to 498 conditions per place. [2024-06-14 14:25:25,071 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 97 selfloop transitions, 24 changer transitions 0/123 dead transitions. [2024-06-14 14:25:25,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 123 transitions, 1335 flow [2024-06-14 14:25:25,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:25:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:25:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-14 14:25:25,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-14 14:25:25,073 INFO L175 Difference]: Start difference. First operand has 122 places, 104 transitions, 1021 flow. Second operand 9 states and 112 transitions. [2024-06-14 14:25:25,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 123 transitions, 1335 flow [2024-06-14 14:25:25,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 123 transitions, 1248 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-14 14:25:25,097 INFO L231 Difference]: Finished difference. Result has 125 places, 107 transitions, 1026 flow [2024-06-14 14:25:25,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1026, PETRI_PLACES=125, PETRI_TRANSITIONS=107} [2024-06-14 14:25:25,097 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 94 predicate places. [2024-06-14 14:25:25,097 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 107 transitions, 1026 flow [2024-06-14 14:25:25,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:25,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:25,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:25,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-14 14:25:25,098 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:25:25,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:25,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1720932563, now seen corresponding path program 2 times [2024-06-14 14:25:25,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:25,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737099650] [2024-06-14 14:25:25,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:25,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:31,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:31,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737099650] [2024-06-14 14:25:31,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737099650] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:31,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:31,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:25:31,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744795435] [2024-06-14 14:25:31,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:31,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:25:31,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:31,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:25:31,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:25:32,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:25:32,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 107 transitions, 1026 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:32,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:32,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:25:32,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:32,347 INFO L124 PetriNetUnfolderBase]: 335/587 cut-off events. [2024-06-14 14:25:32,348 INFO L125 PetriNetUnfolderBase]: For 19386/19386 co-relation queries the response was YES. [2024-06-14 14:25:32,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3876 conditions, 587 events. 335/587 cut-off events. For 19386/19386 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2344 event pairs, 52 based on Foata normal form. 2/588 useless extension candidates. Maximal degree in co-relation 3813. Up to 513 conditions per place. [2024-06-14 14:25:32,351 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 100 selfloop transitions, 23 changer transitions 0/125 dead transitions. [2024-06-14 14:25:32,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 125 transitions, 1330 flow [2024-06-14 14:25:32,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:25:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:25:32,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-14 14:25:32,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-14 14:25:32,353 INFO L175 Difference]: Start difference. First operand has 125 places, 107 transitions, 1026 flow. Second operand 9 states and 111 transitions. [2024-06-14 14:25:32,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 125 transitions, 1330 flow [2024-06-14 14:25:32,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 125 transitions, 1270 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-14 14:25:32,376 INFO L231 Difference]: Finished difference. Result has 127 places, 109 transitions, 1039 flow [2024-06-14 14:25:32,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1039, PETRI_PLACES=127, PETRI_TRANSITIONS=109} [2024-06-14 14:25:32,376 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 96 predicate places. [2024-06-14 14:25:32,376 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 109 transitions, 1039 flow [2024-06-14 14:25:32,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:32,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:32,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 14:25:32,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-14 14:25:32,377 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:25:32,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:32,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1262539898, now seen corresponding path program 5 times [2024-06-14 14:25:32,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:32,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614867143] [2024-06-14 14:25:32,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:32,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:38,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:38,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614867143] [2024-06-14 14:25:38,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614867143] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:38,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:38,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:25:38,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056018464] [2024-06-14 14:25:38,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:38,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:25:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:38,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:25:38,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:25:38,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:25:38,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 109 transitions, 1039 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:38,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:38,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:25:38,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:38,598 INFO L124 PetriNetUnfolderBase]: 343/600 cut-off events. [2024-06-14 14:25:38,599 INFO L125 PetriNetUnfolderBase]: For 20797/20797 co-relation queries the response was YES. [2024-06-14 14:25:38,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4009 conditions, 600 events. 343/600 cut-off events. For 20797/20797 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2419 event pairs, 50 based on Foata normal form. 1/600 useless extension candidates. Maximal degree in co-relation 3945. Up to 505 conditions per place. [2024-06-14 14:25:38,603 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 96 selfloop transitions, 32 changer transitions 0/130 dead transitions. [2024-06-14 14:25:38,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 130 transitions, 1449 flow [2024-06-14 14:25:38,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:25:38,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:25:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-14 14:25:38,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-14 14:25:38,604 INFO L175 Difference]: Start difference. First operand has 127 places, 109 transitions, 1039 flow. Second operand 9 states and 116 transitions. [2024-06-14 14:25:38,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 130 transitions, 1449 flow [2024-06-14 14:25:38,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 130 transitions, 1396 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 14:25:38,629 INFO L231 Difference]: Finished difference. Result has 129 places, 113 transitions, 1105 flow [2024-06-14 14:25:38,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1105, PETRI_PLACES=129, PETRI_TRANSITIONS=113} [2024-06-14 14:25:38,630 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 98 predicate places. [2024-06-14 14:25:38,630 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 113 transitions, 1105 flow [2024-06-14 14:25:38,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:38,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:38,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:38,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-14 14:25:38,631 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:25:38,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:38,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1721140325, now seen corresponding path program 2 times [2024-06-14 14:25:38,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:38,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125435212] [2024-06-14 14:25:38,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:38,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:43,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:43,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125435212] [2024-06-14 14:25:43,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125435212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:43,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:43,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:25:43,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991806369] [2024-06-14 14:25:43,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:43,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:25:43,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:43,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:25:43,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:25:43,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:25:43,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 113 transitions, 1105 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:43,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:43,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:25:43,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:44,105 INFO L124 PetriNetUnfolderBase]: 341/597 cut-off events. [2024-06-14 14:25:44,106 INFO L125 PetriNetUnfolderBase]: For 21353/21353 co-relation queries the response was YES. [2024-06-14 14:25:44,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4043 conditions, 597 events. 341/597 cut-off events. For 21353/21353 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2390 event pairs, 59 based on Foata normal form. 1/597 useless extension candidates. Maximal degree in co-relation 3978. Up to 561 conditions per place. [2024-06-14 14:25:44,112 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 104 selfloop transitions, 17 changer transitions 0/123 dead transitions. [2024-06-14 14:25:44,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 123 transitions, 1373 flow [2024-06-14 14:25:44,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 14:25:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 14:25:44,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-14 14:25:44,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-14 14:25:44,117 INFO L175 Difference]: Start difference. First operand has 129 places, 113 transitions, 1105 flow. Second operand 8 states and 94 transitions. [2024-06-14 14:25:44,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 123 transitions, 1373 flow [2024-06-14 14:25:44,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 123 transitions, 1318 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-14 14:25:44,156 INFO L231 Difference]: Finished difference. Result has 132 places, 113 transitions, 1090 flow [2024-06-14 14:25:44,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1090, PETRI_PLACES=132, PETRI_TRANSITIONS=113} [2024-06-14 14:25:44,157 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 101 predicate places. [2024-06-14 14:25:44,157 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 113 transitions, 1090 flow [2024-06-14 14:25:44,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:44,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:44,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:44,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-14 14:25:44,158 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:25:44,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:44,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1262534101, now seen corresponding path program 3 times [2024-06-14 14:25:44,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:44,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94156043] [2024-06-14 14:25:44,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:44,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:50,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:50,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94156043] [2024-06-14 14:25:50,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94156043] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:50,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:50,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:25:50,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042368634] [2024-06-14 14:25:50,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:50,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:25:50,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:50,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:25:50,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:25:50,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:25:50,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 113 transitions, 1090 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:50,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:50,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:25:50,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:50,828 INFO L124 PetriNetUnfolderBase]: 347/607 cut-off events. [2024-06-14 14:25:50,828 INFO L125 PetriNetUnfolderBase]: For 23233/23233 co-relation queries the response was YES. [2024-06-14 14:25:50,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4120 conditions, 607 events. 347/607 cut-off events. For 23233/23233 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2459 event pairs, 52 based on Foata normal form. 2/608 useless extension candidates. Maximal degree in co-relation 4053. Up to 521 conditions per place. [2024-06-14 14:25:50,832 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 102 selfloop transitions, 27 changer transitions 0/131 dead transitions. [2024-06-14 14:25:50,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 131 transitions, 1410 flow [2024-06-14 14:25:50,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:25:50,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:25:50,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-14 14:25:50,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2024-06-14 14:25:50,833 INFO L175 Difference]: Start difference. First operand has 132 places, 113 transitions, 1090 flow. Second operand 9 states and 122 transitions. [2024-06-14 14:25:50,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 131 transitions, 1410 flow [2024-06-14 14:25:50,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 131 transitions, 1358 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 14:25:50,863 INFO L231 Difference]: Finished difference. Result has 134 places, 115 transitions, 1123 flow [2024-06-14 14:25:50,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1123, PETRI_PLACES=134, PETRI_TRANSITIONS=115} [2024-06-14 14:25:50,863 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 103 predicate places. [2024-06-14 14:25:50,864 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 115 transitions, 1123 flow [2024-06-14 14:25:50,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:50,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:50,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:50,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-14 14:25:50,864 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:25:50,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:50,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1262534318, now seen corresponding path program 6 times [2024-06-14 14:25:50,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:50,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552735119] [2024-06-14 14:25:50,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:50,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:25:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:25:56,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:25:56,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552735119] [2024-06-14 14:25:56,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552735119] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:25:56,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:25:56,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:25:56,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100228896] [2024-06-14 14:25:56,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:25:56,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:25:56,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:25:56,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:25:56,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:25:56,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:25:56,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 115 transitions, 1123 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:56,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:25:56,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:25:56,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:25:56,597 INFO L124 PetriNetUnfolderBase]: 368/641 cut-off events. [2024-06-14 14:25:56,598 INFO L125 PetriNetUnfolderBase]: For 26277/26277 co-relation queries the response was YES. [2024-06-14 14:25:56,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4488 conditions, 641 events. 368/641 cut-off events. For 26277/26277 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2628 event pairs, 55 based on Foata normal form. 2/642 useless extension candidates. Maximal degree in co-relation 4420. Up to 520 conditions per place. [2024-06-14 14:25:56,602 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 101 selfloop transitions, 36 changer transitions 0/139 dead transitions. [2024-06-14 14:25:56,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 139 transitions, 1666 flow [2024-06-14 14:25:56,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:25:56,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:25:56,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-14 14:25:56,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131944444444444 [2024-06-14 14:25:56,633 INFO L175 Difference]: Start difference. First operand has 134 places, 115 transitions, 1123 flow. Second operand 9 states and 119 transitions. [2024-06-14 14:25:56,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 139 transitions, 1666 flow [2024-06-14 14:25:56,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 139 transitions, 1595 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-14 14:25:56,672 INFO L231 Difference]: Finished difference. Result has 137 places, 122 transitions, 1232 flow [2024-06-14 14:25:56,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1232, PETRI_PLACES=137, PETRI_TRANSITIONS=122} [2024-06-14 14:25:56,673 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 106 predicate places. [2024-06-14 14:25:56,673 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 122 transitions, 1232 flow [2024-06-14 14:25:56,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:25:56,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:25:56,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:25:56,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-14 14:25:56,674 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:25:56,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:25:56,674 INFO L85 PathProgramCache]: Analyzing trace with hash -783466076, now seen corresponding path program 7 times [2024-06-14 14:25:56,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:25:56,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002951092] [2024-06-14 14:25:56,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:25:56,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:25:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:02,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:02,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:02,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002951092] [2024-06-14 14:26:02,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002951092] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:02,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:02,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:26:02,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768880445] [2024-06-14 14:26:02,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:02,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:26:02,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:02,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:26:02,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:26:02,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 14:26:02,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 122 transitions, 1232 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:02,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:02,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 14:26:02,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:02,539 INFO L124 PetriNetUnfolderBase]: 398/691 cut-off events. [2024-06-14 14:26:02,540 INFO L125 PetriNetUnfolderBase]: For 33183/33183 co-relation queries the response was YES. [2024-06-14 14:26:02,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4850 conditions, 691 events. 398/691 cut-off events. For 33183/33183 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2909 event pairs, 58 based on Foata normal form. 10/700 useless extension candidates. Maximal degree in co-relation 4780. Up to 596 conditions per place. [2024-06-14 14:26:02,544 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 115 selfloop transitions, 24 changer transitions 0/141 dead transitions. [2024-06-14 14:26:02,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 141 transitions, 1613 flow [2024-06-14 14:26:02,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:26:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:26:02,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-14 14:26:02,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3368055555555556 [2024-06-14 14:26:02,545 INFO L175 Difference]: Start difference. First operand has 137 places, 122 transitions, 1232 flow. Second operand 9 states and 97 transitions. [2024-06-14 14:26:02,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 141 transitions, 1613 flow [2024-06-14 14:26:02,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 141 transitions, 1578 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-14 14:26:02,584 INFO L231 Difference]: Finished difference. Result has 142 places, 127 transitions, 1325 flow [2024-06-14 14:26:02,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1325, PETRI_PLACES=142, PETRI_TRANSITIONS=127} [2024-06-14 14:26:02,585 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 111 predicate places. [2024-06-14 14:26:02,585 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 127 transitions, 1325 flow [2024-06-14 14:26:02,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:02,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:02,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:02,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-14 14:26:02,587 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:26:02,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:02,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1919695397, now seen corresponding path program 4 times [2024-06-14 14:26:02,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:02,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567486729] [2024-06-14 14:26:02,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:02,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:10,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:10,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:10,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567486729] [2024-06-14 14:26:10,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567486729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:10,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:10,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:26:10,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438688991] [2024-06-14 14:26:10,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:10,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:26:10,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:10,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:26:10,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:26:10,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:26:10,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 127 transitions, 1325 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:10,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:10,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:26:10,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:10,632 INFO L124 PetriNetUnfolderBase]: 404/701 cut-off events. [2024-06-14 14:26:10,632 INFO L125 PetriNetUnfolderBase]: For 29683/29683 co-relation queries the response was YES. [2024-06-14 14:26:10,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5055 conditions, 701 events. 404/701 cut-off events. For 29683/29683 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2944 event pairs, 68 based on Foata normal form. 2/702 useless extension candidates. Maximal degree in co-relation 4983. Up to 660 conditions per place. [2024-06-14 14:26:10,659 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 123 selfloop transitions, 16 changer transitions 0/141 dead transitions. [2024-06-14 14:26:10,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 141 transitions, 1657 flow [2024-06-14 14:26:10,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:26:10,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:26:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-14 14:26:10,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2024-06-14 14:26:10,660 INFO L175 Difference]: Start difference. First operand has 142 places, 127 transitions, 1325 flow. Second operand 9 states and 102 transitions. [2024-06-14 14:26:10,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 141 transitions, 1657 flow [2024-06-14 14:26:10,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 141 transitions, 1586 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-14 14:26:10,703 INFO L231 Difference]: Finished difference. Result has 144 places, 129 transitions, 1321 flow [2024-06-14 14:26:10,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1254, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1321, PETRI_PLACES=144, PETRI_TRANSITIONS=129} [2024-06-14 14:26:10,704 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 113 predicate places. [2024-06-14 14:26:10,704 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 129 transitions, 1321 flow [2024-06-14 14:26:10,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:10,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:10,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:10,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-14 14:26:10,704 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:26:10,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:10,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2118771172, now seen corresponding path program 8 times [2024-06-14 14:26:10,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:10,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705249557] [2024-06-14 14:26:10,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:10,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:16,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:16,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705249557] [2024-06-14 14:26:16,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705249557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:16,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:16,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:26:16,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721715040] [2024-06-14 14:26:16,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:16,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:26:16,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:16,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:26:16,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:26:16,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:26:16,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 129 transitions, 1321 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:16,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:16,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:26:16,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:16,559 INFO L124 PetriNetUnfolderBase]: 403/700 cut-off events. [2024-06-14 14:26:16,559 INFO L125 PetriNetUnfolderBase]: For 30429/30429 co-relation queries the response was YES. [2024-06-14 14:26:16,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4951 conditions, 700 events. 403/700 cut-off events. For 30429/30429 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2962 event pairs, 60 based on Foata normal form. 3/702 useless extension candidates. Maximal degree in co-relation 4878. Up to 642 conditions per place. [2024-06-14 14:26:16,564 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 124 selfloop transitions, 20 changer transitions 0/146 dead transitions. [2024-06-14 14:26:16,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 146 transitions, 1689 flow [2024-06-14 14:26:16,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:26:16,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:26:16,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-14 14:26:16,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3715277777777778 [2024-06-14 14:26:16,566 INFO L175 Difference]: Start difference. First operand has 144 places, 129 transitions, 1321 flow. Second operand 9 states and 107 transitions. [2024-06-14 14:26:16,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 146 transitions, 1689 flow [2024-06-14 14:26:16,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 146 transitions, 1635 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-14 14:26:16,609 INFO L231 Difference]: Finished difference. Result has 146 places, 132 transitions, 1365 flow [2024-06-14 14:26:16,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1365, PETRI_PLACES=146, PETRI_TRANSITIONS=132} [2024-06-14 14:26:16,609 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 115 predicate places. [2024-06-14 14:26:16,609 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 132 transitions, 1365 flow [2024-06-14 14:26:16,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:16,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:16,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:16,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-14 14:26:16,610 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:26:16,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:16,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2118771389, now seen corresponding path program 5 times [2024-06-14 14:26:16,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:16,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675937004] [2024-06-14 14:26:16,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:16,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:22,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:22,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675937004] [2024-06-14 14:26:22,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675937004] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:22,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:22,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:26:22,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591681832] [2024-06-14 14:26:22,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:22,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:26:22,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:22,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:26:22,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:26:22,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:26:22,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 132 transitions, 1365 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:22,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:22,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:26:22,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:22,931 INFO L124 PetriNetUnfolderBase]: 409/710 cut-off events. [2024-06-14 14:26:22,931 INFO L125 PetriNetUnfolderBase]: For 31140/31140 co-relation queries the response was YES. [2024-06-14 14:26:22,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5079 conditions, 710 events. 409/710 cut-off events. For 31140/31140 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3005 event pairs, 62 based on Foata normal form. 2/711 useless extension candidates. Maximal degree in co-relation 5005. Up to 657 conditions per place. [2024-06-14 14:26:22,936 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 127 selfloop transitions, 19 changer transitions 0/148 dead transitions. [2024-06-14 14:26:22,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 148 transitions, 1721 flow [2024-06-14 14:26:22,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:26:22,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:26:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 14:26:22,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2024-06-14 14:26:22,945 INFO L175 Difference]: Start difference. First operand has 146 places, 132 transitions, 1365 flow. Second operand 9 states and 106 transitions. [2024-06-14 14:26:22,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 148 transitions, 1721 flow [2024-06-14 14:26:22,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 148 transitions, 1651 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-14 14:26:22,999 INFO L231 Difference]: Finished difference. Result has 148 places, 134 transitions, 1372 flow [2024-06-14 14:26:22,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1372, PETRI_PLACES=148, PETRI_TRANSITIONS=134} [2024-06-14 14:26:23,000 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 117 predicate places. [2024-06-14 14:26:23,000 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 134 transitions, 1372 flow [2024-06-14 14:26:23,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:23,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:23,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:23,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-14 14:26:23,001 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:26:23,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:23,001 INFO L85 PathProgramCache]: Analyzing trace with hash -237079674, now seen corresponding path program 9 times [2024-06-14 14:26:23,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:23,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327695931] [2024-06-14 14:26:23,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:23,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:29,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:29,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327695931] [2024-06-14 14:26:29,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327695931] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:29,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:29,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:26:29,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217550077] [2024-06-14 14:26:29,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:29,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:26:29,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:29,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:26:29,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:26:29,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:26:29,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 134 transitions, 1372 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:29,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:29,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:26:29,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:29,546 INFO L124 PetriNetUnfolderBase]: 412/715 cut-off events. [2024-06-14 14:26:29,546 INFO L125 PetriNetUnfolderBase]: For 32135/32135 co-relation queries the response was YES. [2024-06-14 14:26:29,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5120 conditions, 715 events. 412/715 cut-off events. For 32135/32135 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3053 event pairs, 56 based on Foata normal form. 1/715 useless extension candidates. Maximal degree in co-relation 5045. Up to 619 conditions per place. [2024-06-14 14:26:29,552 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 120 selfloop transitions, 32 changer transitions 0/154 dead transitions. [2024-06-14 14:26:29,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 154 transitions, 1887 flow [2024-06-14 14:26:29,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:26:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:26:29,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-14 14:26:29,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 14:26:29,554 INFO L175 Difference]: Start difference. First operand has 148 places, 134 transitions, 1372 flow. Second operand 9 states and 108 transitions. [2024-06-14 14:26:29,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 154 transitions, 1887 flow [2024-06-14 14:26:29,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 154 transitions, 1830 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-14 14:26:29,603 INFO L231 Difference]: Finished difference. Result has 151 places, 141 transitions, 1505 flow [2024-06-14 14:26:29,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1505, PETRI_PLACES=151, PETRI_TRANSITIONS=141} [2024-06-14 14:26:29,603 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 120 predicate places. [2024-06-14 14:26:29,603 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 141 transitions, 1505 flow [2024-06-14 14:26:29,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:29,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:29,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:29,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-14 14:26:29,606 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:26:29,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:29,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2118569579, now seen corresponding path program 6 times [2024-06-14 14:26:29,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:29,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570913733] [2024-06-14 14:26:29,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:29,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:35,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:35,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570913733] [2024-06-14 14:26:35,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570913733] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:35,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:35,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 14:26:35,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980140381] [2024-06-14 14:26:35,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:35,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 14:26:35,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:35,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 14:26:35,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 14:26:35,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:26:35,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 141 transitions, 1505 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:35,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:35,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:26:35,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:36,079 INFO L124 PetriNetUnfolderBase]: 408/709 cut-off events. [2024-06-14 14:26:36,079 INFO L125 PetriNetUnfolderBase]: For 32859/32859 co-relation queries the response was YES. [2024-06-14 14:26:36,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5116 conditions, 709 events. 408/709 cut-off events. For 32859/32859 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3022 event pairs, 59 based on Foata normal form. 2/710 useless extension candidates. Maximal degree in co-relation 5039. Up to 627 conditions per place. [2024-06-14 14:26:36,084 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 124 selfloop transitions, 27 changer transitions 0/153 dead transitions. [2024-06-14 14:26:36,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 153 transitions, 1835 flow [2024-06-14 14:26:36,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:26:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:26:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-14 14:26:36,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-14 14:26:36,086 INFO L175 Difference]: Start difference. First operand has 151 places, 141 transitions, 1505 flow. Second operand 9 states and 114 transitions. [2024-06-14 14:26:36,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 153 transitions, 1835 flow [2024-06-14 14:26:36,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 153 transitions, 1764 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-14 14:26:36,137 INFO L231 Difference]: Finished difference. Result has 155 places, 141 transitions, 1493 flow [2024-06-14 14:26:36,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1493, PETRI_PLACES=155, PETRI_TRANSITIONS=141} [2024-06-14 14:26:36,138 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 124 predicate places. [2024-06-14 14:26:36,138 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 141 transitions, 1493 flow [2024-06-14 14:26:36,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:36,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:36,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:36,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-14 14:26:36,138 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:26:36,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:36,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2118569362, now seen corresponding path program 10 times [2024-06-14 14:26:36,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:36,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002442804] [2024-06-14 14:26:36,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:36,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:42,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:42,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:42,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002442804] [2024-06-14 14:26:42,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002442804] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:42,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:42,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:26:42,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409121584] [2024-06-14 14:26:42,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:42,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:26:42,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:42,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:26:42,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:26:42,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:26:42,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 141 transitions, 1493 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:42,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:42,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:26:42,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:42,557 INFO L124 PetriNetUnfolderBase]: 406/706 cut-off events. [2024-06-14 14:26:42,557 INFO L125 PetriNetUnfolderBase]: For 32295/32295 co-relation queries the response was YES. [2024-06-14 14:26:42,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5083 conditions, 706 events. 406/706 cut-off events. For 32295/32295 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3013 event pairs, 55 based on Foata normal form. 1/706 useless extension candidates. Maximal degree in co-relation 5004. Up to 611 conditions per place. [2024-06-14 14:26:42,562 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 120 selfloop transitions, 31 changer transitions 0/153 dead transitions. [2024-06-14 14:26:42,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 153 transitions, 1834 flow [2024-06-14 14:26:42,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:26:42,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:26:42,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 14:26:42,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2024-06-14 14:26:42,563 INFO L175 Difference]: Start difference. First operand has 155 places, 141 transitions, 1493 flow. Second operand 9 states and 106 transitions. [2024-06-14 14:26:42,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 153 transitions, 1834 flow [2024-06-14 14:26:42,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 153 transitions, 1705 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-14 14:26:42,620 INFO L231 Difference]: Finished difference. Result has 156 places, 142 transitions, 1444 flow [2024-06-14 14:26:42,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1370, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1444, PETRI_PLACES=156, PETRI_TRANSITIONS=142} [2024-06-14 14:26:42,621 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 125 predicate places. [2024-06-14 14:26:42,621 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 142 transitions, 1444 flow [2024-06-14 14:26:42,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:42,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:42,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:42,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-14 14:26:42,621 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:26:42,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:42,622 INFO L85 PathProgramCache]: Analyzing trace with hash -767822428, now seen corresponding path program 1 times [2024-06-14 14:26:42,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:42,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48268103] [2024-06-14 14:26:42,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:42,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:26:49,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:49,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48268103] [2024-06-14 14:26:49,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48268103] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:49,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:49,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:26:49,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576064459] [2024-06-14 14:26:49,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:49,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:26:49,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:49,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:26:49,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:26:49,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:26:49,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 142 transitions, 1444 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:49,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:49,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:26:49,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:50,110 INFO L124 PetriNetUnfolderBase]: 417/727 cut-off events. [2024-06-14 14:26:50,111 INFO L125 PetriNetUnfolderBase]: For 36405/36405 co-relation queries the response was YES. [2024-06-14 14:26:50,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5199 conditions, 727 events. 417/727 cut-off events. For 36405/36405 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3128 event pairs, 49 based on Foata normal form. 2/728 useless extension candidates. Maximal degree in co-relation 5119. Up to 639 conditions per place. [2024-06-14 14:26:50,116 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 148 selfloop transitions, 19 changer transitions 0/169 dead transitions. [2024-06-14 14:26:50,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 169 transitions, 1958 flow [2024-06-14 14:26:50,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:26:50,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:26:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-14 14:26:50,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3664772727272727 [2024-06-14 14:26:50,118 INFO L175 Difference]: Start difference. First operand has 156 places, 142 transitions, 1444 flow. Second operand 11 states and 129 transitions. [2024-06-14 14:26:50,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 169 transitions, 1958 flow [2024-06-14 14:26:50,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 169 transitions, 1906 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-14 14:26:50,181 INFO L231 Difference]: Finished difference. Result has 161 places, 144 transitions, 1460 flow [2024-06-14 14:26:50,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1460, PETRI_PLACES=161, PETRI_TRANSITIONS=144} [2024-06-14 14:26:50,182 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 130 predicate places. [2024-06-14 14:26:50,182 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 144 transitions, 1460 flow [2024-06-14 14:26:50,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:50,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:50,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:50,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-14 14:26:50,183 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:26:50,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:50,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2099468398, now seen corresponding path program 1 times [2024-06-14 14:26:50,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:50,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858085382] [2024-06-14 14:26:50,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:50,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:26:56,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 14:26:56,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:26:56,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858085382] [2024-06-14 14:26:56,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858085382] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:26:56,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:26:56,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:26:56,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872000908] [2024-06-14 14:26:56,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:26:56,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:26:56,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:26:56,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:26:56,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:26:56,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:26:56,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 144 transitions, 1460 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:56,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:26:56,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:26:56,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:26:57,342 INFO L124 PetriNetUnfolderBase]: 423/737 cut-off events. [2024-06-14 14:26:57,342 INFO L125 PetriNetUnfolderBase]: For 36911/36911 co-relation queries the response was YES. [2024-06-14 14:26:57,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5278 conditions, 737 events. 423/737 cut-off events. For 36911/36911 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3188 event pairs, 65 based on Foata normal form. 1/737 useless extension candidates. Maximal degree in co-relation 5197. Up to 671 conditions per place. [2024-06-14 14:26:57,348 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 146 selfloop transitions, 23 changer transitions 0/171 dead transitions. [2024-06-14 14:26:57,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 171 transitions, 1987 flow [2024-06-14 14:26:57,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:26:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:26:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-14 14:26:57,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-14 14:26:57,349 INFO L175 Difference]: Start difference. First operand has 161 places, 144 transitions, 1460 flow. Second operand 11 states and 131 transitions. [2024-06-14 14:26:57,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 171 transitions, 1987 flow [2024-06-14 14:26:57,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 171 transitions, 1948 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-14 14:26:57,410 INFO L231 Difference]: Finished difference. Result has 167 places, 148 transitions, 1512 flow [2024-06-14 14:26:57,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1512, PETRI_PLACES=167, PETRI_TRANSITIONS=148} [2024-06-14 14:26:57,410 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 136 predicate places. [2024-06-14 14:26:57,411 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 148 transitions, 1512 flow [2024-06-14 14:26:57,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:26:57,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:26:57,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:26:57,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-14 14:26:57,411 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:26:57,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:26:57,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1110473008, now seen corresponding path program 2 times [2024-06-14 14:26:57,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:26:57,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489296750] [2024-06-14 14:26:57,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:26:57,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:26:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:27:03,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:03,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489296750] [2024-06-14 14:27:03,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489296750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:03,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:03,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:27:03,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859605769] [2024-06-14 14:27:03,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:03,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:27:03,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:03,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:27:03,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:27:03,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:27:03,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 148 transitions, 1512 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:03,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:03,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:27:03,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:04,330 INFO L124 PetriNetUnfolderBase]: 420/732 cut-off events. [2024-06-14 14:27:04,331 INFO L125 PetriNetUnfolderBase]: For 37548/37548 co-relation queries the response was YES. [2024-06-14 14:27:04,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5215 conditions, 732 events. 420/732 cut-off events. For 37548/37548 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3148 event pairs, 64 based on Foata normal form. 2/733 useless extension candidates. Maximal degree in co-relation 5131. Up to 670 conditions per place. [2024-06-14 14:27:04,338 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 146 selfloop transitions, 18 changer transitions 0/166 dead transitions. [2024-06-14 14:27:04,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 166 transitions, 1890 flow [2024-06-14 14:27:04,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:27:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:27:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2024-06-14 14:27:04,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 14:27:04,340 INFO L175 Difference]: Start difference. First operand has 167 places, 148 transitions, 1512 flow. Second operand 9 states and 108 transitions. [2024-06-14 14:27:04,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 166 transitions, 1890 flow [2024-06-14 14:27:04,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 166 transitions, 1843 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-14 14:27:04,430 INFO L231 Difference]: Finished difference. Result has 168 places, 148 transitions, 1506 flow [2024-06-14 14:27:04,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1465, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1506, PETRI_PLACES=168, PETRI_TRANSITIONS=148} [2024-06-14 14:27:04,431 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 137 predicate places. [2024-06-14 14:27:04,431 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 148 transitions, 1506 flow [2024-06-14 14:27:04,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:04,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:04,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:04,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-14 14:27:04,432 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:27:04,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:04,432 INFO L85 PathProgramCache]: Analyzing trace with hash -764960694, now seen corresponding path program 2 times [2024-06-14 14:27:04,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:04,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427928507] [2024-06-14 14:27:04,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:04,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:27:09,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:09,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427928507] [2024-06-14 14:27:09,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427928507] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:09,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:09,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:27:09,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008094485] [2024-06-14 14:27:09,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:09,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:27:09,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:09,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:27:09,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:27:10,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:27:10,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 148 transitions, 1506 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:10,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:10,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:27:10,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:10,481 INFO L124 PetriNetUnfolderBase]: 423/737 cut-off events. [2024-06-14 14:27:10,481 INFO L125 PetriNetUnfolderBase]: For 38122/38122 co-relation queries the response was YES. [2024-06-14 14:27:10,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5248 conditions, 737 events. 423/737 cut-off events. For 38122/38122 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3178 event pairs, 64 based on Foata normal form. 1/737 useless extension candidates. Maximal degree in co-relation 5164. Up to 692 conditions per place. [2024-06-14 14:27:10,487 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 149 selfloop transitions, 17 changer transitions 0/168 dead transitions. [2024-06-14 14:27:10,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 168 transitions, 1906 flow [2024-06-14 14:27:10,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:27:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:27:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 14:27:10,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 14:27:10,488 INFO L175 Difference]: Start difference. First operand has 168 places, 148 transitions, 1506 flow. Second operand 10 states and 125 transitions. [2024-06-14 14:27:10,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 168 transitions, 1906 flow [2024-06-14 14:27:10,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 168 transitions, 1868 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-14 14:27:10,555 INFO L231 Difference]: Finished difference. Result has 170 places, 150 transitions, 1529 flow [2024-06-14 14:27:10,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1529, PETRI_PLACES=170, PETRI_TRANSITIONS=150} [2024-06-14 14:27:10,555 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 139 predicate places. [2024-06-14 14:27:10,555 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 150 transitions, 1529 flow [2024-06-14 14:27:10,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:10,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:10,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:10,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-14 14:27:10,556 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:27:10,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:10,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2096667052, now seen corresponding path program 1 times [2024-06-14 14:27:10,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:10,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482908692] [2024-06-14 14:27:10,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:10,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:27:16,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:16,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482908692] [2024-06-14 14:27:16,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482908692] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:16,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:16,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:27:16,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382723768] [2024-06-14 14:27:16,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:16,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:27:16,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:16,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:27:16,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:27:17,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:27:17,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 150 transitions, 1529 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:17,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:17,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:27:17,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:17,465 INFO L124 PetriNetUnfolderBase]: 429/747 cut-off events. [2024-06-14 14:27:17,465 INFO L125 PetriNetUnfolderBase]: For 40862/40862 co-relation queries the response was YES. [2024-06-14 14:27:17,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5342 conditions, 747 events. 429/747 cut-off events. For 40862/40862 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3249 event pairs, 63 based on Foata normal form. 2/748 useless extension candidates. Maximal degree in co-relation 5257. Up to 699 conditions per place. [2024-06-14 14:27:17,473 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 152 selfloop transitions, 17 changer transitions 0/171 dead transitions. [2024-06-14 14:27:17,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 171 transitions, 1949 flow [2024-06-14 14:27:17,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:27:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:27:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-14 14:27:17,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-14 14:27:17,475 INFO L175 Difference]: Start difference. First operand has 170 places, 150 transitions, 1529 flow. Second operand 10 states and 116 transitions. [2024-06-14 14:27:17,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 171 transitions, 1949 flow [2024-06-14 14:27:17,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 171 transitions, 1912 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-14 14:27:17,578 INFO L231 Difference]: Finished difference. Result has 172 places, 152 transitions, 1565 flow [2024-06-14 14:27:17,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1565, PETRI_PLACES=172, PETRI_TRANSITIONS=152} [2024-06-14 14:27:17,578 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 141 predicate places. [2024-06-14 14:27:17,579 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 152 transitions, 1565 flow [2024-06-14 14:27:17,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:17,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:17,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:17,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-14 14:27:17,580 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:27:17,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:17,580 INFO L85 PathProgramCache]: Analyzing trace with hash -764965344, now seen corresponding path program 3 times [2024-06-14 14:27:17,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:17,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809850745] [2024-06-14 14:27:17,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:17,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:22,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:27:22,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:22,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809850745] [2024-06-14 14:27:22,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809850745] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:22,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:22,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:27:22,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091376888] [2024-06-14 14:27:22,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:22,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:27:22,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:22,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:27:22,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:27:22,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:27:22,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 152 transitions, 1565 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:22,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:22,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:27:22,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:23,359 INFO L124 PetriNetUnfolderBase]: 427/744 cut-off events. [2024-06-14 14:27:23,359 INFO L125 PetriNetUnfolderBase]: For 40096/40096 co-relation queries the response was YES. [2024-06-14 14:27:23,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5351 conditions, 744 events. 427/744 cut-off events. For 40096/40096 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3225 event pairs, 63 based on Foata normal form. 1/744 useless extension candidates. Maximal degree in co-relation 5265. Up to 693 conditions per place. [2024-06-14 14:27:23,376 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 148 selfloop transitions, 21 changer transitions 0/171 dead transitions. [2024-06-14 14:27:23,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 171 transitions, 1955 flow [2024-06-14 14:27:23,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:27:23,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:27:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 14:27:23,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-14 14:27:23,378 INFO L175 Difference]: Start difference. First operand has 172 places, 152 transitions, 1565 flow. Second operand 11 states and 135 transitions. [2024-06-14 14:27:23,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 171 transitions, 1955 flow [2024-06-14 14:27:23,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 171 transitions, 1892 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-14 14:27:23,467 INFO L231 Difference]: Finished difference. Result has 175 places, 152 transitions, 1552 flow [2024-06-14 14:27:23,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1552, PETRI_PLACES=175, PETRI_TRANSITIONS=152} [2024-06-14 14:27:23,482 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 144 predicate places. [2024-06-14 14:27:23,482 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 152 transitions, 1552 flow [2024-06-14 14:27:23,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:23,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:23,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:23,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-14 14:27:23,483 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:27:23,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:23,484 INFO L85 PathProgramCache]: Analyzing trace with hash -649496358, now seen corresponding path program 2 times [2024-06-14 14:27:23,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:23,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034557851] [2024-06-14 14:27:23,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:23,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:29,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:27:29,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:29,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034557851] [2024-06-14 14:27:29,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034557851] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:29,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:29,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:27:29,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950279232] [2024-06-14 14:27:29,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:29,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:27:29,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:29,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:27:29,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:27:29,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:27:29,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 152 transitions, 1552 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:29,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:29,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:27:29,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:30,081 INFO L124 PetriNetUnfolderBase]: 479/828 cut-off events. [2024-06-14 14:27:30,082 INFO L125 PetriNetUnfolderBase]: For 55461/55461 co-relation queries the response was YES. [2024-06-14 14:27:30,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6225 conditions, 828 events. 479/828 cut-off events. For 55461/55461 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3696 event pairs, 45 based on Foata normal form. 4/831 useless extension candidates. Maximal degree in co-relation 6138. Up to 356 conditions per place. [2024-06-14 14:27:30,088 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 118 selfloop transitions, 68 changer transitions 0/188 dead transitions. [2024-06-14 14:27:30,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 188 transitions, 2474 flow [2024-06-14 14:27:30,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:27:30,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:27:30,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-14 14:27:30,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43125 [2024-06-14 14:27:30,090 INFO L175 Difference]: Start difference. First operand has 175 places, 152 transitions, 1552 flow. Second operand 10 states and 138 transitions. [2024-06-14 14:27:30,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 188 transitions, 2474 flow [2024-06-14 14:27:30,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 188 transitions, 2390 flow, removed 5 selfloop flow, removed 12 redundant places. [2024-06-14 14:27:30,185 INFO L231 Difference]: Finished difference. Result has 173 places, 161 transitions, 1744 flow [2024-06-14 14:27:30,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1744, PETRI_PLACES=173, PETRI_TRANSITIONS=161} [2024-06-14 14:27:30,185 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 142 predicate places. [2024-06-14 14:27:30,185 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 161 transitions, 1744 flow [2024-06-14 14:27:30,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:30,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:30,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:30,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-14 14:27:30,186 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:27:30,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:30,186 INFO L85 PathProgramCache]: Analyzing trace with hash -649489848, now seen corresponding path program 3 times [2024-06-14 14:27:30,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:30,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610008216] [2024-06-14 14:27:30,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:30,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:38,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 14:27:38,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:38,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610008216] [2024-06-14 14:27:38,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610008216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:38,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:38,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:27:38,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503451100] [2024-06-14 14:27:38,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:38,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:27:38,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:38,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:27:38,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:27:38,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:27:38,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 161 transitions, 1744 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:38,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:38,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:27:38,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:38,873 INFO L124 PetriNetUnfolderBase]: 475/822 cut-off events. [2024-06-14 14:27:38,873 INFO L125 PetriNetUnfolderBase]: For 51695/51695 co-relation queries the response was YES. [2024-06-14 14:27:38,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6283 conditions, 822 events. 475/822 cut-off events. For 51695/51695 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3687 event pairs, 49 based on Foata normal form. 2/823 useless extension candidates. Maximal degree in co-relation 6196. Up to 524 conditions per place. [2024-06-14 14:27:38,878 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 131 selfloop transitions, 61 changer transitions 0/194 dead transitions. [2024-06-14 14:27:38,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 194 transitions, 2579 flow [2024-06-14 14:27:38,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:27:38,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:27:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-14 14:27:38,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-14 14:27:38,879 INFO L175 Difference]: Start difference. First operand has 173 places, 161 transitions, 1744 flow. Second operand 10 states and 130 transitions. [2024-06-14 14:27:38,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 194 transitions, 2579 flow [2024-06-14 14:27:38,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 194 transitions, 2462 flow, removed 42 selfloop flow, removed 4 redundant places. [2024-06-14 14:27:38,959 INFO L231 Difference]: Finished difference. Result has 183 places, 173 transitions, 2027 flow [2024-06-14 14:27:38,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1656, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2027, PETRI_PLACES=183, PETRI_TRANSITIONS=173} [2024-06-14 14:27:38,960 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 152 predicate places. [2024-06-14 14:27:38,960 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 173 transitions, 2027 flow [2024-06-14 14:27:38,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:38,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:38,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:38,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-14 14:27:38,960 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:27:38,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:38,961 INFO L85 PathProgramCache]: Analyzing trace with hash -649674298, now seen corresponding path program 3 times [2024-06-14 14:27:38,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:38,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552975249] [2024-06-14 14:27:38,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:38,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:27:44,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:44,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552975249] [2024-06-14 14:27:44,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552975249] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:44,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:44,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:27:44,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748374562] [2024-06-14 14:27:44,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:44,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:27:44,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:44,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:27:44,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:27:44,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:27:44,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 173 transitions, 2027 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:44,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:44,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:27:44,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:45,272 INFO L124 PetriNetUnfolderBase]: 479/830 cut-off events. [2024-06-14 14:27:45,272 INFO L125 PetriNetUnfolderBase]: For 52762/52762 co-relation queries the response was YES. [2024-06-14 14:27:45,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6550 conditions, 830 events. 479/830 cut-off events. For 52762/52762 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3712 event pairs, 73 based on Foata normal form. 2/831 useless extension candidates. Maximal degree in co-relation 6457. Up to 755 conditions per place. [2024-06-14 14:27:45,279 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 160 selfloop transitions, 29 changer transitions 0/191 dead transitions. [2024-06-14 14:27:45,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 191 transitions, 2472 flow [2024-06-14 14:27:45,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:27:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:27:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-14 14:27:45,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.365625 [2024-06-14 14:27:45,281 INFO L175 Difference]: Start difference. First operand has 183 places, 173 transitions, 2027 flow. Second operand 10 states and 117 transitions. [2024-06-14 14:27:45,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 191 transitions, 2472 flow [2024-06-14 14:27:45,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 191 transitions, 2385 flow, removed 33 selfloop flow, removed 3 redundant places. [2024-06-14 14:27:45,382 INFO L231 Difference]: Finished difference. Result has 191 places, 175 transitions, 2043 flow [2024-06-14 14:27:45,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1940, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2043, PETRI_PLACES=191, PETRI_TRANSITIONS=175} [2024-06-14 14:27:45,382 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 160 predicate places. [2024-06-14 14:27:45,383 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 175 transitions, 2043 flow [2024-06-14 14:27:45,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:45,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:45,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:45,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-14 14:27:45,388 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:27:45,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:45,389 INFO L85 PathProgramCache]: Analyzing trace with hash -649669338, now seen corresponding path program 4 times [2024-06-14 14:27:45,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:45,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824543648] [2024-06-14 14:27:45,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:45,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:27:51,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:51,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824543648] [2024-06-14 14:27:51,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824543648] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:51,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:51,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:27:51,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418806075] [2024-06-14 14:27:51,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:51,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:27:51,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:51,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:27:51,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:27:52,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:27:52,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 175 transitions, 2043 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:52,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:52,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:27:52,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:52,422 INFO L124 PetriNetUnfolderBase]: 491/850 cut-off events. [2024-06-14 14:27:52,422 INFO L125 PetriNetUnfolderBase]: For 57452/57452 co-relation queries the response was YES. [2024-06-14 14:27:52,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6652 conditions, 850 events. 491/850 cut-off events. For 57452/57452 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3828 event pairs, 43 based on Foata normal form. 4/853 useless extension candidates. Maximal degree in co-relation 6556. Up to 377 conditions per place. [2024-06-14 14:27:52,430 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 128 selfloop transitions, 75 changer transitions 0/205 dead transitions. [2024-06-14 14:27:52,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 205 transitions, 2984 flow [2024-06-14 14:27:52,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:27:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:27:52,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2024-06-14 14:27:52,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44375 [2024-06-14 14:27:52,432 INFO L175 Difference]: Start difference. First operand has 191 places, 175 transitions, 2043 flow. Second operand 10 states and 142 transitions. [2024-06-14 14:27:52,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 205 transitions, 2984 flow [2024-06-14 14:27:52,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 205 transitions, 2898 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-14 14:27:52,548 INFO L231 Difference]: Finished difference. Result has 193 places, 179 transitions, 2167 flow [2024-06-14 14:27:52,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1957, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2167, PETRI_PLACES=193, PETRI_TRANSITIONS=179} [2024-06-14 14:27:52,549 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 162 predicate places. [2024-06-14 14:27:52,549 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 179 transitions, 2167 flow [2024-06-14 14:27:52,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:52,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:52,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:52,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-14 14:27:52,550 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:27:52,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:52,550 INFO L85 PathProgramCache]: Analyzing trace with hash -483857224, now seen corresponding path program 5 times [2024-06-14 14:27:52,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:52,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280686643] [2024-06-14 14:27:52,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:52,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:27:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:27:58,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:27:58,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280686643] [2024-06-14 14:27:58,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280686643] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:27:58,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:27:58,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:27:58,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172270413] [2024-06-14 14:27:58,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:27:58,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:27:58,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:27:58,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:27:58,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:27:58,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:27:58,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 179 transitions, 2167 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:58,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:27:58,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:27:58,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:27:59,168 INFO L124 PetriNetUnfolderBase]: 527/908 cut-off events. [2024-06-14 14:27:59,168 INFO L125 PetriNetUnfolderBase]: For 67227/67227 co-relation queries the response was YES. [2024-06-14 14:27:59,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7588 conditions, 908 events. 527/908 cut-off events. For 67227/67227 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4169 event pairs, 63 based on Foata normal form. 2/909 useless extension candidates. Maximal degree in co-relation 7492. Up to 763 conditions per place. [2024-06-14 14:27:59,176 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 169 selfloop transitions, 38 changer transitions 0/209 dead transitions. [2024-06-14 14:27:59,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 209 transitions, 3127 flow [2024-06-14 14:27:59,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:27:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:27:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-14 14:27:59,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.409375 [2024-06-14 14:27:59,177 INFO L175 Difference]: Start difference. First operand has 193 places, 179 transitions, 2167 flow. Second operand 10 states and 131 transitions. [2024-06-14 14:27:59,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 209 transitions, 3127 flow [2024-06-14 14:27:59,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 209 transitions, 2968 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-14 14:27:59,287 INFO L231 Difference]: Finished difference. Result has 197 places, 187 transitions, 2269 flow [2024-06-14 14:27:59,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2016, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2269, PETRI_PLACES=197, PETRI_TRANSITIONS=187} [2024-06-14 14:27:59,287 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 166 predicate places. [2024-06-14 14:27:59,287 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 187 transitions, 2269 flow [2024-06-14 14:27:59,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:27:59,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:27:59,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:27:59,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-14 14:27:59,288 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:27:59,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:27:59,288 INFO L85 PathProgramCache]: Analyzing trace with hash -477601114, now seen corresponding path program 6 times [2024-06-14 14:27:59,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:27:59,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681563289] [2024-06-14 14:27:59,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:27:59,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:27:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:28:05,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:05,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681563289] [2024-06-14 14:28:05,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681563289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:05,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:05,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:28:05,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866184518] [2024-06-14 14:28:05,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:05,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:28:05,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:05,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:28:05,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:28:05,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:28:05,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 187 transitions, 2269 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:05,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:05,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:28:05,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:05,799 INFO L124 PetriNetUnfolderBase]: 533/918 cut-off events. [2024-06-14 14:28:05,799 INFO L125 PetriNetUnfolderBase]: For 69617/69617 co-relation queries the response was YES. [2024-06-14 14:28:05,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7595 conditions, 918 events. 533/918 cut-off events. For 69617/69617 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4214 event pairs, 66 based on Foata normal form. 2/919 useless extension candidates. Maximal degree in co-relation 7498. Up to 816 conditions per place. [2024-06-14 14:28:05,807 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 177 selfloop transitions, 29 changer transitions 0/208 dead transitions. [2024-06-14 14:28:05,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 208 transitions, 2881 flow [2024-06-14 14:28:05,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:28:05,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:28:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-14 14:28:05,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-14 14:28:05,808 INFO L175 Difference]: Start difference. First operand has 197 places, 187 transitions, 2269 flow. Second operand 10 states and 123 transitions. [2024-06-14 14:28:05,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 208 transitions, 2881 flow [2024-06-14 14:28:05,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 208 transitions, 2808 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-06-14 14:28:05,935 INFO L231 Difference]: Finished difference. Result has 203 places, 189 transitions, 2305 flow [2024-06-14 14:28:05,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2200, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2305, PETRI_PLACES=203, PETRI_TRANSITIONS=189} [2024-06-14 14:28:05,936 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 172 predicate places. [2024-06-14 14:28:05,936 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 189 transitions, 2305 flow [2024-06-14 14:28:05,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:05,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:05,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:05,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-14 14:28:05,937 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:28:05,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:05,937 INFO L85 PathProgramCache]: Analyzing trace with hash -477601300, now seen corresponding path program 4 times [2024-06-14 14:28:05,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:05,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080873011] [2024-06-14 14:28:05,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:05,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:12,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:28:12,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:12,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080873011] [2024-06-14 14:28:12,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080873011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:12,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:12,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:28:12,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097890012] [2024-06-14 14:28:12,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:12,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:28:12,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:12,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:28:12,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:28:12,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:28:12,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 189 transitions, 2305 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:12,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:12,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:28:12,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:13,245 INFO L124 PetriNetUnfolderBase]: 527/909 cut-off events. [2024-06-14 14:28:13,245 INFO L125 PetriNetUnfolderBase]: For 67811/67811 co-relation queries the response was YES. [2024-06-14 14:28:13,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7403 conditions, 909 events. 527/909 cut-off events. For 67811/67811 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4180 event pairs, 55 based on Foata normal form. 3/911 useless extension candidates. Maximal degree in co-relation 7304. Up to 805 conditions per place. [2024-06-14 14:28:13,253 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 176 selfloop transitions, 30 changer transitions 0/208 dead transitions. [2024-06-14 14:28:13,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 208 transitions, 2763 flow [2024-06-14 14:28:13,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:28:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:28:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 14:28:13,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 14:28:13,255 INFO L175 Difference]: Start difference. First operand has 203 places, 189 transitions, 2305 flow. Second operand 10 states and 125 transitions. [2024-06-14 14:28:13,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 208 transitions, 2763 flow [2024-06-14 14:28:13,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 208 transitions, 2664 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-14 14:28:13,394 INFO L231 Difference]: Finished difference. Result has 205 places, 189 transitions, 2272 flow [2024-06-14 14:28:13,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2206, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2272, PETRI_PLACES=205, PETRI_TRANSITIONS=189} [2024-06-14 14:28:13,395 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 174 predicate places. [2024-06-14 14:28:13,395 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 189 transitions, 2272 flow [2024-06-14 14:28:13,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:13,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:13,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:13,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-14 14:28:13,396 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:28:13,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:13,396 INFO L85 PathProgramCache]: Analyzing trace with hash -477594604, now seen corresponding path program 7 times [2024-06-14 14:28:13,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:13,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26386819] [2024-06-14 14:28:13,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:13,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:28:21,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:21,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26386819] [2024-06-14 14:28:21,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26386819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:21,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:21,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:28:21,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884465818] [2024-06-14 14:28:21,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:21,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:28:21,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:21,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:28:21,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:28:21,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:28:21,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 189 transitions, 2272 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:21,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:21,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:28:21,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:21,891 INFO L124 PetriNetUnfolderBase]: 523/903 cut-off events. [2024-06-14 14:28:21,891 INFO L125 PetriNetUnfolderBase]: For 65757/65757 co-relation queries the response was YES. [2024-06-14 14:28:21,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7249 conditions, 903 events. 523/903 cut-off events. For 65757/65757 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4150 event pairs, 65 based on Foata normal form. 2/904 useless extension candidates. Maximal degree in co-relation 7149. Up to 804 conditions per place. [2024-06-14 14:28:21,899 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 176 selfloop transitions, 29 changer transitions 0/207 dead transitions. [2024-06-14 14:28:21,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 207 transitions, 2726 flow [2024-06-14 14:28:21,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:28:21,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:28:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-14 14:28:21,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-14 14:28:21,901 INFO L175 Difference]: Start difference. First operand has 205 places, 189 transitions, 2272 flow. Second operand 10 states and 133 transitions. [2024-06-14 14:28:21,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 207 transitions, 2726 flow [2024-06-14 14:28:22,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 207 transitions, 2629 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-14 14:28:22,025 INFO L231 Difference]: Finished difference. Result has 206 places, 189 transitions, 2238 flow [2024-06-14 14:28:22,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2175, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2238, PETRI_PLACES=206, PETRI_TRANSITIONS=189} [2024-06-14 14:28:22,026 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 175 predicate places. [2024-06-14 14:28:22,026 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 189 transitions, 2238 flow [2024-06-14 14:28:22,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:22,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:22,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:22,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-14 14:28:22,027 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:28:22,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:22,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1809061580, now seen corresponding path program 1 times [2024-06-14 14:28:22,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:22,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526862423] [2024-06-14 14:28:22,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:22,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:28:27,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:27,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526862423] [2024-06-14 14:28:27,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526862423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:27,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:27,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:28:27,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882102687] [2024-06-14 14:28:27,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:27,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:28:27,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:27,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:28:27,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:28:27,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:28:27,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 189 transitions, 2238 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:27,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:27,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:28:27,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:28,115 INFO L124 PetriNetUnfolderBase]: 527/911 cut-off events. [2024-06-14 14:28:28,115 INFO L125 PetriNetUnfolderBase]: For 67489/67489 co-relation queries the response was YES. [2024-06-14 14:28:28,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7274 conditions, 911 events. 527/911 cut-off events. For 67489/67489 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4215 event pairs, 75 based on Foata normal form. 2/912 useless extension candidates. Maximal degree in co-relation 7173. Up to 848 conditions per place. [2024-06-14 14:28:28,125 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 183 selfloop transitions, 21 changer transitions 0/206 dead transitions. [2024-06-14 14:28:28,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 206 transitions, 2712 flow [2024-06-14 14:28:28,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:28:28,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:28:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-14 14:28:28,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3715277777777778 [2024-06-14 14:28:28,127 INFO L175 Difference]: Start difference. First operand has 206 places, 189 transitions, 2238 flow. Second operand 9 states and 107 transitions. [2024-06-14 14:28:28,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 206 transitions, 2712 flow [2024-06-14 14:28:28,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 206 transitions, 2642 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-14 14:28:28,293 INFO L231 Difference]: Finished difference. Result has 207 places, 192 transitions, 2253 flow [2024-06-14 14:28:28,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2170, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2253, PETRI_PLACES=207, PETRI_TRANSITIONS=192} [2024-06-14 14:28:28,294 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 176 predicate places. [2024-06-14 14:28:28,294 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 192 transitions, 2253 flow [2024-06-14 14:28:28,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:28,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:28,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:28,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-14 14:28:28,295 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:28:28,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:28,295 INFO L85 PathProgramCache]: Analyzing trace with hash -483850714, now seen corresponding path program 8 times [2024-06-14 14:28:28,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:28,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316817858] [2024-06-14 14:28:28,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:28,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:28:34,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:34,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316817858] [2024-06-14 14:28:34,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316817858] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:34,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:34,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:28:34,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322779724] [2024-06-14 14:28:34,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:34,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:28:34,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:34,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:28:34,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:28:34,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:28:34,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 192 transitions, 2253 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:34,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:34,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:28:34,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:34,984 INFO L124 PetriNetUnfolderBase]: 553/953 cut-off events. [2024-06-14 14:28:34,985 INFO L125 PetriNetUnfolderBase]: For 76572/76572 co-relation queries the response was YES. [2024-06-14 14:28:34,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7740 conditions, 953 events. 553/953 cut-off events. For 76572/76572 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4443 event pairs, 68 based on Foata normal form. 2/954 useless extension candidates. Maximal degree in co-relation 7637. Up to 737 conditions per place. [2024-06-14 14:28:34,993 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 167 selfloop transitions, 50 changer transitions 0/219 dead transitions. [2024-06-14 14:28:34,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 219 transitions, 3173 flow [2024-06-14 14:28:34,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:28:34,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:28:34,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-14 14:28:34,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-14 14:28:34,994 INFO L175 Difference]: Start difference. First operand has 207 places, 192 transitions, 2253 flow. Second operand 10 states and 134 transitions. [2024-06-14 14:28:34,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 219 transitions, 3173 flow [2024-06-14 14:28:35,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 219 transitions, 3101 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-14 14:28:35,159 INFO L231 Difference]: Finished difference. Result has 211 places, 198 transitions, 2380 flow [2024-06-14 14:28:35,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2181, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2380, PETRI_PLACES=211, PETRI_TRANSITIONS=198} [2024-06-14 14:28:35,161 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 180 predicate places. [2024-06-14 14:28:35,161 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 198 transitions, 2380 flow [2024-06-14 14:28:35,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:35,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:35,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:35,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-14 14:28:35,162 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:28:35,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:35,162 INFO L85 PathProgramCache]: Analyzing trace with hash -484035164, now seen corresponding path program 4 times [2024-06-14 14:28:35,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:35,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486589168] [2024-06-14 14:28:35,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:35,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:42,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 14:28:42,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:42,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486589168] [2024-06-14 14:28:42,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486589168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:42,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:42,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:28:42,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418903357] [2024-06-14 14:28:42,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:42,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:28:42,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:42,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:28:42,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:28:42,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:28:42,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 198 transitions, 2380 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:42,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:42,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:28:42,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:42,911 INFO L124 PetriNetUnfolderBase]: 557/961 cut-off events. [2024-06-14 14:28:42,911 INFO L125 PetriNetUnfolderBase]: For 79928/79928 co-relation queries the response was YES. [2024-06-14 14:28:42,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7880 conditions, 961 events. 557/961 cut-off events. For 79928/79928 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4493 event pairs, 83 based on Foata normal form. 2/962 useless extension candidates. Maximal degree in co-relation 7776. Up to 919 conditions per place. [2024-06-14 14:28:42,919 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 191 selfloop transitions, 18 changer transitions 0/211 dead transitions. [2024-06-14 14:28:42,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 211 transitions, 2844 flow [2024-06-14 14:28:42,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:28:42,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:28:42,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-14 14:28:42,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3576388888888889 [2024-06-14 14:28:42,922 INFO L175 Difference]: Start difference. First operand has 211 places, 198 transitions, 2380 flow. Second operand 9 states and 103 transitions. [2024-06-14 14:28:42,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 211 transitions, 2844 flow [2024-06-14 14:28:43,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 211 transitions, 2798 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-14 14:28:43,108 INFO L231 Difference]: Finished difference. Result has 216 places, 199 transitions, 2392 flow [2024-06-14 14:28:43,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2334, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2392, PETRI_PLACES=216, PETRI_TRANSITIONS=199} [2024-06-14 14:28:43,109 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 185 predicate places. [2024-06-14 14:28:43,109 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 199 transitions, 2392 flow [2024-06-14 14:28:43,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:43,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:43,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:43,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-14 14:28:43,110 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:28:43,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:43,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1281295532, now seen corresponding path program 5 times [2024-06-14 14:28:43,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:43,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043063587] [2024-06-14 14:28:43,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:43,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:28:49,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:49,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043063587] [2024-06-14 14:28:49,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043063587] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:49,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:49,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:28:49,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874121244] [2024-06-14 14:28:49,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:49,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:28:49,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:49,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:28:49,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:28:49,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:28:49,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 199 transitions, 2392 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:49,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:49,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:28:49,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:49,757 INFO L124 PetriNetUnfolderBase]: 560/966 cut-off events. [2024-06-14 14:28:49,758 INFO L125 PetriNetUnfolderBase]: For 79771/79771 co-relation queries the response was YES. [2024-06-14 14:28:49,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7957 conditions, 966 events. 560/966 cut-off events. For 79771/79771 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4521 event pairs, 61 based on Foata normal form. 1/966 useless extension candidates. Maximal degree in co-relation 7851. Up to 855 conditions per place. [2024-06-14 14:28:49,765 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 178 selfloop transitions, 38 changer transitions 0/218 dead transitions. [2024-06-14 14:28:49,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 218 transitions, 2896 flow [2024-06-14 14:28:49,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:28:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:28:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 14:28:49,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-14 14:28:49,766 INFO L175 Difference]: Start difference. First operand has 216 places, 199 transitions, 2392 flow. Second operand 10 states and 126 transitions. [2024-06-14 14:28:49,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 218 transitions, 2896 flow [2024-06-14 14:28:49,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 218 transitions, 2848 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-14 14:28:49,934 INFO L231 Difference]: Finished difference. Result has 219 places, 201 transitions, 2461 flow [2024-06-14 14:28:49,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2344, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2461, PETRI_PLACES=219, PETRI_TRANSITIONS=201} [2024-06-14 14:28:49,935 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 188 predicate places. [2024-06-14 14:28:49,935 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 201 transitions, 2461 flow [2024-06-14 14:28:49,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:49,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:49,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:49,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-14 14:28:49,936 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:28:49,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:49,936 INFO L85 PathProgramCache]: Analyzing trace with hash -484030204, now seen corresponding path program 9 times [2024-06-14 14:28:49,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:49,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862608648] [2024-06-14 14:28:49,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:49,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:28:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:28:56,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:28:56,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862608648] [2024-06-14 14:28:56,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862608648] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:28:56,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:28:56,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:28:56,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537056388] [2024-06-14 14:28:56,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:28:56,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:28:56,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:28:56,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:28:56,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:28:56,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:28:56,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 201 transitions, 2461 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:56,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:28:56,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:28:56,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:28:56,836 INFO L124 PetriNetUnfolderBase]: 574/990 cut-off events. [2024-06-14 14:28:56,837 INFO L125 PetriNetUnfolderBase]: For 88342/88342 co-relation queries the response was YES. [2024-06-14 14:28:56,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8165 conditions, 990 events. 574/990 cut-off events. For 88342/88342 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4674 event pairs, 66 based on Foata normal form. 4/993 useless extension candidates. Maximal degree in co-relation 8058. Up to 764 conditions per place. [2024-06-14 14:28:56,846 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 169 selfloop transitions, 54 changer transitions 0/225 dead transitions. [2024-06-14 14:28:56,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 225 transitions, 3255 flow [2024-06-14 14:28:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:28:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:28:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-14 14:28:56,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-14 14:28:56,848 INFO L175 Difference]: Start difference. First operand has 219 places, 201 transitions, 2461 flow. Second operand 10 states and 132 transitions. [2024-06-14 14:28:56,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 225 transitions, 3255 flow [2024-06-14 14:28:57,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 225 transitions, 3152 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-14 14:28:57,012 INFO L231 Difference]: Finished difference. Result has 221 places, 205 transitions, 2533 flow [2024-06-14 14:28:57,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2358, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2533, PETRI_PLACES=221, PETRI_TRANSITIONS=205} [2024-06-14 14:28:57,012 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 190 predicate places. [2024-06-14 14:28:57,012 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 205 transitions, 2533 flow [2024-06-14 14:28:57,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:28:57,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:28:57,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:28:57,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-14 14:28:57,013 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:28:57,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:28:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1815741584, now seen corresponding path program 6 times [2024-06-14 14:28:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:28:57,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848662457] [2024-06-14 14:28:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:28:57,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:28:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:03,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:03,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848662457] [2024-06-14 14:29:03,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848662457] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:03,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:03,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:29:03,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146714793] [2024-06-14 14:29:03,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:03,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:29:03,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:03,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:29:03,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:29:03,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:29:03,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 205 transitions, 2533 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:03,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:03,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:29:03,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:03,851 INFO L124 PetriNetUnfolderBase]: 570/983 cut-off events. [2024-06-14 14:29:03,851 INFO L125 PetriNetUnfolderBase]: For 84118/84118 co-relation queries the response was YES. [2024-06-14 14:29:03,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8128 conditions, 983 events. 570/983 cut-off events. For 84118/84118 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4632 event pairs, 60 based on Foata normal form. 1/983 useless extension candidates. Maximal degree in co-relation 8020. Up to 852 conditions per place. [2024-06-14 14:29:03,860 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 175 selfloop transitions, 46 changer transitions 0/223 dead transitions. [2024-06-14 14:29:03,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 223 transitions, 3017 flow [2024-06-14 14:29:03,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:29:03,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:29:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-14 14:29:03,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-14 14:29:03,862 INFO L175 Difference]: Start difference. First operand has 221 places, 205 transitions, 2533 flow. Second operand 10 states and 129 transitions. [2024-06-14 14:29:03,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 223 transitions, 3017 flow [2024-06-14 14:29:04,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 223 transitions, 2910 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-14 14:29:04,029 INFO L231 Difference]: Finished difference. Result has 225 places, 205 transitions, 2523 flow [2024-06-14 14:29:04,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2426, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2523, PETRI_PLACES=225, PETRI_TRANSITIONS=205} [2024-06-14 14:29:04,029 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 194 predicate places. [2024-06-14 14:29:04,029 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 205 transitions, 2523 flow [2024-06-14 14:29:04,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:04,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:04,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:04,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-14 14:29:04,030 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:29:04,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:04,030 INFO L85 PathProgramCache]: Analyzing trace with hash -575642262, now seen corresponding path program 10 times [2024-06-14 14:29:04,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:04,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137055250] [2024-06-14 14:29:04,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:04,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:10,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:10,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137055250] [2024-06-14 14:29:10,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137055250] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:10,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:10,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:29:10,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053517663] [2024-06-14 14:29:10,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:10,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:29:10,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:10,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:29:10,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:29:10,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:29:10,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 205 transitions, 2523 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:10,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:10,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:29:10,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:10,902 INFO L124 PetriNetUnfolderBase]: 586/1009 cut-off events. [2024-06-14 14:29:10,903 INFO L125 PetriNetUnfolderBase]: For 93104/93104 co-relation queries the response was YES. [2024-06-14 14:29:10,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8469 conditions, 1009 events. 586/1009 cut-off events. For 93104/93104 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4764 event pairs, 77 based on Foata normal form. 2/1010 useless extension candidates. Maximal degree in co-relation 8360. Up to 940 conditions per place. [2024-06-14 14:29:10,913 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 200 selfloop transitions, 22 changer transitions 0/224 dead transitions. [2024-06-14 14:29:10,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 224 transitions, 3221 flow [2024-06-14 14:29:10,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:29:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:29:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-14 14:29:10,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35625 [2024-06-14 14:29:10,914 INFO L175 Difference]: Start difference. First operand has 225 places, 205 transitions, 2523 flow. Second operand 10 states and 114 transitions. [2024-06-14 14:29:10,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 224 transitions, 3221 flow [2024-06-14 14:29:11,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 224 transitions, 3125 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-14 14:29:11,107 INFO L231 Difference]: Finished difference. Result has 227 places, 209 transitions, 2572 flow [2024-06-14 14:29:11,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2427, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2572, PETRI_PLACES=227, PETRI_TRANSITIONS=209} [2024-06-14 14:29:11,107 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 196 predicate places. [2024-06-14 14:29:11,107 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 209 transitions, 2572 flow [2024-06-14 14:29:11,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:11,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:11,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:11,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-14 14:29:11,108 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:29:11,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:11,108 INFO L85 PathProgramCache]: Analyzing trace with hash 903941254, now seen corresponding path program 2 times [2024-06-14 14:29:11,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:11,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106942400] [2024-06-14 14:29:11,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:11,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:16,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:16,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:16,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106942400] [2024-06-14 14:29:16,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106942400] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:16,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:16,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:29:16,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795794092] [2024-06-14 14:29:16,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:16,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:29:16,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:16,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:29:16,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:29:16,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:29:16,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 209 transitions, 2572 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:16,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:16,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:29:16,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:16,712 INFO L124 PetriNetUnfolderBase]: 590/1017 cut-off events. [2024-06-14 14:29:16,712 INFO L125 PetriNetUnfolderBase]: For 95460/95460 co-relation queries the response was YES. [2024-06-14 14:29:16,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8506 conditions, 1017 events. 590/1017 cut-off events. For 95460/95460 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4838 event pairs, 82 based on Foata normal form. 2/1018 useless extension candidates. Maximal degree in co-relation 8396. Up to 982 conditions per place. [2024-06-14 14:29:16,722 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 205 selfloop transitions, 14 changer transitions 0/221 dead transitions. [2024-06-14 14:29:16,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 221 transitions, 3046 flow [2024-06-14 14:29:16,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:29:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:29:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-14 14:29:16,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 14:29:16,724 INFO L175 Difference]: Start difference. First operand has 227 places, 209 transitions, 2572 flow. Second operand 9 states and 99 transitions. [2024-06-14 14:29:16,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 221 transitions, 3046 flow [2024-06-14 14:29:16,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 221 transitions, 2966 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-14 14:29:16,955 INFO L231 Difference]: Finished difference. Result has 229 places, 210 transitions, 2538 flow [2024-06-14 14:29:16,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2492, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2538, PETRI_PLACES=229, PETRI_TRANSITIONS=210} [2024-06-14 14:29:16,956 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 198 predicate places. [2024-06-14 14:29:16,956 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 210 transitions, 2538 flow [2024-06-14 14:29:16,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:16,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:16,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:16,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-14 14:29:16,956 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:29:16,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:16,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1194358378, now seen corresponding path program 3 times [2024-06-14 14:29:16,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:16,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227091908] [2024-06-14 14:29:16,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:16,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:22,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:22,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:22,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227091908] [2024-06-14 14:29:22,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227091908] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:22,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:22,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:29:22,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257551921] [2024-06-14 14:29:22,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:22,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:29:22,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:22,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:29:22,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:29:22,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:29:22,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 210 transitions, 2538 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:22,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:22,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:29:22,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:23,131 INFO L124 PetriNetUnfolderBase]: 597/1030 cut-off events. [2024-06-14 14:29:23,131 INFO L125 PetriNetUnfolderBase]: For 98387/98387 co-relation queries the response was YES. [2024-06-14 14:29:23,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8537 conditions, 1030 events. 597/1030 cut-off events. For 98387/98387 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4938 event pairs, 74 based on Foata normal form. 2/1031 useless extension candidates. Maximal degree in co-relation 8426. Up to 979 conditions per place. [2024-06-14 14:29:23,140 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 206 selfloop transitions, 20 changer transitions 0/228 dead transitions. [2024-06-14 14:29:23,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 228 transitions, 3085 flow [2024-06-14 14:29:23,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:29:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:29:23,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-14 14:29:23,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3576388888888889 [2024-06-14 14:29:23,142 INFO L175 Difference]: Start difference. First operand has 229 places, 210 transitions, 2538 flow. Second operand 9 states and 103 transitions. [2024-06-14 14:29:23,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 228 transitions, 3085 flow [2024-06-14 14:29:23,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 228 transitions, 3044 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-14 14:29:23,355 INFO L231 Difference]: Finished difference. Result has 234 places, 217 transitions, 2641 flow [2024-06-14 14:29:23,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2502, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2641, PETRI_PLACES=234, PETRI_TRANSITIONS=217} [2024-06-14 14:29:23,355 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 203 predicate places. [2024-06-14 14:29:23,356 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 217 transitions, 2641 flow [2024-06-14 14:29:23,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:23,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:23,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:23,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-14 14:29:23,356 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:29:23,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:23,357 INFO L85 PathProgramCache]: Analyzing trace with hash 619225158, now seen corresponding path program 4 times [2024-06-14 14:29:23,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:23,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753242310] [2024-06-14 14:29:23,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:23,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:29,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:29,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753242310] [2024-06-14 14:29:29,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753242310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:29,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:29,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:29:29,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040180681] [2024-06-14 14:29:29,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:29,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:29:29,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:29,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:29:29,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:29:29,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:29:29,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 217 transitions, 2641 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:29,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:29,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:29:29,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:30,249 INFO L124 PetriNetUnfolderBase]: 601/1038 cut-off events. [2024-06-14 14:29:30,250 INFO L125 PetriNetUnfolderBase]: For 101438/101438 co-relation queries the response was YES. [2024-06-14 14:29:30,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8779 conditions, 1038 events. 601/1038 cut-off events. For 101438/101438 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4981 event pairs, 79 based on Foata normal form. 2/1039 useless extension candidates. Maximal degree in co-relation 8664. Up to 999 conditions per place. [2024-06-14 14:29:30,260 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 211 selfloop transitions, 17 changer transitions 0/230 dead transitions. [2024-06-14 14:29:30,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 230 transitions, 3166 flow [2024-06-14 14:29:30,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:29:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:29:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-14 14:29:30,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2024-06-14 14:29:30,263 INFO L175 Difference]: Start difference. First operand has 234 places, 217 transitions, 2641 flow. Second operand 9 states and 101 transitions. [2024-06-14 14:29:30,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 230 transitions, 3166 flow [2024-06-14 14:29:30,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 230 transitions, 3127 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-14 14:29:30,513 INFO L231 Difference]: Finished difference. Result has 239 places, 219 transitions, 2683 flow [2024-06-14 14:29:30,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2603, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2683, PETRI_PLACES=239, PETRI_TRANSITIONS=219} [2024-06-14 14:29:30,514 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 208 predicate places. [2024-06-14 14:29:30,514 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 219 transitions, 2683 flow [2024-06-14 14:29:30,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:30,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:30,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:30,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-14 14:29:30,515 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:29:30,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:30,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1250963936, now seen corresponding path program 7 times [2024-06-14 14:29:30,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:30,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414874229] [2024-06-14 14:29:30,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:30,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:36,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:36,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414874229] [2024-06-14 14:29:36,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414874229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:36,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:36,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:29:36,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191151022] [2024-06-14 14:29:36,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:36,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:29:36,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:36,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:29:36,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:29:36,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:29:36,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 219 transitions, 2683 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:36,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:36,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:29:36,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:37,011 INFO L124 PetriNetUnfolderBase]: 604/1043 cut-off events. [2024-06-14 14:29:37,011 INFO L125 PetriNetUnfolderBase]: For 102212/102212 co-relation queries the response was YES. [2024-06-14 14:29:37,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8853 conditions, 1043 events. 604/1043 cut-off events. For 102212/102212 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5007 event pairs, 67 based on Foata normal form. 1/1043 useless extension candidates. Maximal degree in co-relation 8737. Up to 871 conditions per place. [2024-06-14 14:29:37,023 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 181 selfloop transitions, 51 changer transitions 0/234 dead transitions. [2024-06-14 14:29:37,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 234 transitions, 3371 flow [2024-06-14 14:29:37,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:29:37,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:29:37,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-14 14:29:37,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-14 14:29:37,024 INFO L175 Difference]: Start difference. First operand has 239 places, 219 transitions, 2683 flow. Second operand 9 states and 112 transitions. [2024-06-14 14:29:37,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 234 transitions, 3371 flow [2024-06-14 14:29:37,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 234 transitions, 3313 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-14 14:29:37,272 INFO L231 Difference]: Finished difference. Result has 240 places, 221 transitions, 2772 flow [2024-06-14 14:29:37,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2625, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2772, PETRI_PLACES=240, PETRI_TRANSITIONS=221} [2024-06-14 14:29:37,274 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 209 predicate places. [2024-06-14 14:29:37,274 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 221 transitions, 2772 flow [2024-06-14 14:29:37,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:37,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:37,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:37,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-14 14:29:37,274 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:29:37,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:37,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1240460708, now seen corresponding path program 5 times [2024-06-14 14:29:37,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:37,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13377598] [2024-06-14 14:29:37,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:37,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:43,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:43,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13377598] [2024-06-14 14:29:43,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13377598] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:43,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:43,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:29:43,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671839570] [2024-06-14 14:29:43,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:43,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:29:43,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:43,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:29:43,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:29:43,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:29:43,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 221 transitions, 2772 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:43,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:43,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:29:43,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:43,826 INFO L124 PetriNetUnfolderBase]: 601/1038 cut-off events. [2024-06-14 14:29:43,827 INFO L125 PetriNetUnfolderBase]: For 102483/102483 co-relation queries the response was YES. [2024-06-14 14:29:43,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8796 conditions, 1038 events. 601/1038 cut-off events. For 102483/102483 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4990 event pairs, 89 based on Foata normal form. 2/1039 useless extension candidates. Maximal degree in co-relation 8681. Up to 1008 conditions per place. [2024-06-14 14:29:43,837 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 213 selfloop transitions, 16 changer transitions 0/231 dead transitions. [2024-06-14 14:29:43,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 231 transitions, 3252 flow [2024-06-14 14:29:43,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:29:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:29:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-14 14:29:43,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33125 [2024-06-14 14:29:43,838 INFO L175 Difference]: Start difference. First operand has 240 places, 221 transitions, 2772 flow. Second operand 10 states and 106 transitions. [2024-06-14 14:29:43,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 231 transitions, 3252 flow [2024-06-14 14:29:44,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 231 transitions, 3095 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-14 14:29:44,068 INFO L231 Difference]: Finished difference. Result has 241 places, 221 transitions, 2651 flow [2024-06-14 14:29:44,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2615, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2651, PETRI_PLACES=241, PETRI_TRANSITIONS=221} [2024-06-14 14:29:44,084 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 210 predicate places. [2024-06-14 14:29:44,084 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 221 transitions, 2651 flow [2024-06-14 14:29:44,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:44,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:44,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:44,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-14 14:29:44,085 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:29:44,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:44,085 INFO L85 PathProgramCache]: Analyzing trace with hash 744719384, now seen corresponding path program 11 times [2024-06-14 14:29:44,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:44,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315988344] [2024-06-14 14:29:44,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:44,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:49,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:49,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:49,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315988344] [2024-06-14 14:29:49,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315988344] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:49,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:49,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:29:49,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591247755] [2024-06-14 14:29:49,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:49,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:29:49,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:49,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:29:49,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:29:50,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-06-14 14:29:50,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 221 transitions, 2651 flow. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:50,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:50,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-06-14 14:29:50,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:50,543 INFO L124 PetriNetUnfolderBase]: 640/1102 cut-off events. [2024-06-14 14:29:50,543 INFO L125 PetriNetUnfolderBase]: For 118496/118496 co-relation queries the response was YES. [2024-06-14 14:29:50,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9416 conditions, 1102 events. 640/1102 cut-off events. For 118496/118496 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5394 event pairs, 74 based on Foata normal form. 4/1105 useless extension candidates. Maximal degree in co-relation 9303. Up to 981 conditions per place. [2024-06-14 14:29:50,554 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 212 selfloop transitions, 32 changer transitions 0/246 dead transitions. [2024-06-14 14:29:50,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 246 transitions, 3519 flow [2024-06-14 14:29:50,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:29:50,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:29:50,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-14 14:29:50,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2024-06-14 14:29:50,555 INFO L175 Difference]: Start difference. First operand has 241 places, 221 transitions, 2651 flow. Second operand 10 states and 110 transitions. [2024-06-14 14:29:50,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 246 transitions, 3519 flow [2024-06-14 14:29:50,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 246 transitions, 3426 flow, removed 9 selfloop flow, removed 10 redundant places. [2024-06-14 14:29:50,776 INFO L231 Difference]: Finished difference. Result has 242 places, 230 transitions, 2828 flow [2024-06-14 14:29:50,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2558, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2828, PETRI_PLACES=242, PETRI_TRANSITIONS=230} [2024-06-14 14:29:50,777 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 211 predicate places. [2024-06-14 14:29:50,777 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 230 transitions, 2828 flow [2024-06-14 14:29:50,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:50,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:50,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:50,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-14 14:29:50,778 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:29:50,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:50,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1257397676, now seen corresponding path program 8 times [2024-06-14 14:29:50,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:50,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459300237] [2024-06-14 14:29:50,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:50,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:29:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:29:56,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:29:56,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459300237] [2024-06-14 14:29:56,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459300237] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:29:56,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:29:56,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:29:56,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837088060] [2024-06-14 14:29:56,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:29:56,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:29:56,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:29:56,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:29:56,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:29:56,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:29:56,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 230 transitions, 2828 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:56,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:29:56,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:29:56,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:29:57,415 INFO L124 PetriNetUnfolderBase]: 632/1089 cut-off events. [2024-06-14 14:29:57,415 INFO L125 PetriNetUnfolderBase]: For 113430/113430 co-relation queries the response was YES. [2024-06-14 14:29:57,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9222 conditions, 1089 events. 632/1089 cut-off events. For 113430/113430 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5308 event pairs, 80 based on Foata normal form. 3/1091 useless extension candidates. Maximal degree in co-relation 9108. Up to 1005 conditions per place. [2024-06-14 14:29:57,426 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 211 selfloop transitions, 31 changer transitions 0/244 dead transitions. [2024-06-14 14:29:57,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 244 transitions, 3352 flow [2024-06-14 14:29:57,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:29:57,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:29:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-14 14:29:57,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 14:29:57,428 INFO L175 Difference]: Start difference. First operand has 242 places, 230 transitions, 2828 flow. Second operand 10 states and 120 transitions. [2024-06-14 14:29:57,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 244 transitions, 3352 flow [2024-06-14 14:29:57,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 244 transitions, 3214 flow, removed 45 selfloop flow, removed 9 redundant places. [2024-06-14 14:29:57,660 INFO L231 Difference]: Finished difference. Result has 243 places, 230 transitions, 2758 flow [2024-06-14 14:29:57,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2690, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2758, PETRI_PLACES=243, PETRI_TRANSITIONS=230} [2024-06-14 14:29:57,661 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 212 predicate places. [2024-06-14 14:29:57,661 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 230 transitions, 2758 flow [2024-06-14 14:29:57,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:29:57,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:29:57,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:29:57,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-14 14:29:57,662 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:29:57,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:29:57,662 INFO L85 PathProgramCache]: Analyzing trace with hash 618985590, now seen corresponding path program 12 times [2024-06-14 14:29:57,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:29:57,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226575712] [2024-06-14 14:29:57,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:29:57,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:29:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:04,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:04,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:04,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226575712] [2024-06-14 14:30:04,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226575712] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:04,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:04,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:30:04,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25027472] [2024-06-14 14:30:04,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:04,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:30:04,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:04,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:30:04,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:30:04,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:30:04,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 230 transitions, 2758 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:04,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:04,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:30:04,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:04,890 INFO L124 PetriNetUnfolderBase]: 648/1115 cut-off events. [2024-06-14 14:30:04,891 INFO L125 PetriNetUnfolderBase]: For 115134/115134 co-relation queries the response was YES. [2024-06-14 14:30:04,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9394 conditions, 1115 events. 648/1115 cut-off events. For 115134/115134 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5438 event pairs, 80 based on Foata normal form. 2/1116 useless extension candidates. Maximal degree in co-relation 9281. Up to 1014 conditions per place. [2024-06-14 14:30:04,903 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 218 selfloop transitions, 29 changer transitions 0/249 dead transitions. [2024-06-14 14:30:04,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 249 transitions, 3640 flow [2024-06-14 14:30:04,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:30:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:30:04,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 14:30:04,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-14 14:30:04,906 INFO L175 Difference]: Start difference. First operand has 243 places, 230 transitions, 2758 flow. Second operand 10 states and 118 transitions. [2024-06-14 14:30:04,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 249 transitions, 3640 flow [2024-06-14 14:30:05,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 249 transitions, 3538 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-14 14:30:05,207 INFO L231 Difference]: Finished difference. Result has 245 places, 234 transitions, 2795 flow [2024-06-14 14:30:05,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2656, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2795, PETRI_PLACES=245, PETRI_TRANSITIONS=234} [2024-06-14 14:30:05,208 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 214 predicate places. [2024-06-14 14:30:05,208 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 234 transitions, 2795 flow [2024-06-14 14:30:05,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:05,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:05,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:05,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-14 14:30:05,209 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:30:05,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:05,209 INFO L85 PathProgramCache]: Analyzing trace with hash 914800548, now seen corresponding path program 5 times [2024-06-14 14:30:05,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:05,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786673685] [2024-06-14 14:30:05,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:05,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:10,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:10,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:10,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786673685] [2024-06-14 14:30:10,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786673685] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:10,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:10,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:30:10,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054023644] [2024-06-14 14:30:10,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:10,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:30:10,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:10,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:30:10,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:30:11,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:30:11,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 234 transitions, 2795 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:11,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:11,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:30:11,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:11,562 INFO L124 PetriNetUnfolderBase]: 645/1110 cut-off events. [2024-06-14 14:30:11,562 INFO L125 PetriNetUnfolderBase]: For 113291/113291 co-relation queries the response was YES. [2024-06-14 14:30:11,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9229 conditions, 1110 events. 645/1110 cut-off events. For 113291/113291 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5405 event pairs, 88 based on Foata normal form. 2/1111 useless extension candidates. Maximal degree in co-relation 9115. Up to 1075 conditions per place. [2024-06-14 14:30:11,573 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 228 selfloop transitions, 14 changer transitions 0/244 dead transitions. [2024-06-14 14:30:11,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 244 transitions, 3301 flow [2024-06-14 14:30:11,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 14:30:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 14:30:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-14 14:30:11,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3368055555555556 [2024-06-14 14:30:11,575 INFO L175 Difference]: Start difference. First operand has 245 places, 234 transitions, 2795 flow. Second operand 9 states and 97 transitions. [2024-06-14 14:30:11,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 244 transitions, 3301 flow [2024-06-14 14:30:11,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 244 transitions, 3255 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-14 14:30:11,888 INFO L231 Difference]: Finished difference. Result has 249 places, 234 transitions, 2781 flow [2024-06-14 14:30:11,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2749, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2781, PETRI_PLACES=249, PETRI_TRANSITIONS=234} [2024-06-14 14:30:11,888 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 218 predicate places. [2024-06-14 14:30:11,888 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 234 transitions, 2781 flow [2024-06-14 14:30:11,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:11,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:11,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:11,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-14 14:30:11,889 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:30:11,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:11,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1194597946, now seen corresponding path program 13 times [2024-06-14 14:30:11,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:11,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835834591] [2024-06-14 14:30:11,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:11,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:18,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:18,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:18,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835834591] [2024-06-14 14:30:18,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835834591] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:18,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:18,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:30:18,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893827876] [2024-06-14 14:30:18,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:18,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:30:18,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:18,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:30:18,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:30:19,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:30:19,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 234 transitions, 2781 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:19,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:19,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:30:19,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:19,635 INFO L124 PetriNetUnfolderBase]: 641/1104 cut-off events. [2024-06-14 14:30:19,636 INFO L125 PetriNetUnfolderBase]: For 111256/111256 co-relation queries the response was YES. [2024-06-14 14:30:19,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9049 conditions, 1104 events. 641/1104 cut-off events. For 111256/111256 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5399 event pairs, 83 based on Foata normal form. 2/1105 useless extension candidates. Maximal degree in co-relation 8933. Up to 1026 conditions per place. [2024-06-14 14:30:19,646 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 220 selfloop transitions, 27 changer transitions 0/249 dead transitions. [2024-06-14 14:30:19,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 249 transitions, 3344 flow [2024-06-14 14:30:19,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:30:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:30:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 14:30:19,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-14 14:30:19,648 INFO L175 Difference]: Start difference. First operand has 249 places, 234 transitions, 2781 flow. Second operand 10 states and 118 transitions. [2024-06-14 14:30:19,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 249 transitions, 3344 flow [2024-06-14 14:30:19,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 249 transitions, 3259 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-14 14:30:19,901 INFO L231 Difference]: Finished difference. Result has 250 places, 235 transitions, 2786 flow [2024-06-14 14:30:19,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2696, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2786, PETRI_PLACES=250, PETRI_TRANSITIONS=235} [2024-06-14 14:30:19,902 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 219 predicate places. [2024-06-14 14:30:19,902 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 235 transitions, 2786 flow [2024-06-14 14:30:19,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:19,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:19,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:19,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-14 14:30:19,903 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:30:19,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:19,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1240465668, now seen corresponding path program 14 times [2024-06-14 14:30:19,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:19,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837324746] [2024-06-14 14:30:19,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:19,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:25,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 14:30:25,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:25,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837324746] [2024-06-14 14:30:25,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837324746] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:25,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:25,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:30:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102436661] [2024-06-14 14:30:25,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:25,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:30:25,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:25,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:30:25,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:30:26,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:30:26,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 235 transitions, 2786 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:26,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:26,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:30:26,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:26,549 INFO L124 PetriNetUnfolderBase]: 663/1140 cut-off events. [2024-06-14 14:30:26,550 INFO L125 PetriNetUnfolderBase]: For 124289/124289 co-relation queries the response was YES. [2024-06-14 14:30:26,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9486 conditions, 1140 events. 663/1140 cut-off events. For 124289/124289 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5599 event pairs, 73 based on Foata normal form. 4/1143 useless extension candidates. Maximal degree in co-relation 9370. Up to 868 conditions per place. [2024-06-14 14:30:26,561 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 194 selfloop transitions, 61 changer transitions 0/257 dead transitions. [2024-06-14 14:30:26,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 257 transitions, 3764 flow [2024-06-14 14:30:26,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:30:26,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:30:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-14 14:30:26,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-14 14:30:26,562 INFO L175 Difference]: Start difference. First operand has 250 places, 235 transitions, 2786 flow. Second operand 10 states and 124 transitions. [2024-06-14 14:30:26,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 257 transitions, 3764 flow [2024-06-14 14:30:26,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 257 transitions, 3667 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-14 14:30:26,876 INFO L231 Difference]: Finished difference. Result has 252 places, 241 transitions, 2957 flow [2024-06-14 14:30:26,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2689, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2957, PETRI_PLACES=252, PETRI_TRANSITIONS=241} [2024-06-14 14:30:26,877 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 221 predicate places. [2024-06-14 14:30:26,877 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 241 transitions, 2957 flow [2024-06-14 14:30:26,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:26,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:26,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:26,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-14 14:30:26,878 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:30:26,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:26,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1251141752, now seen corresponding path program 15 times [2024-06-14 14:30:26,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:26,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196737869] [2024-06-14 14:30:26,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:26,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:33,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:33,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196737869] [2024-06-14 14:30:33,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196737869] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:33,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:33,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:30:33,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267496863] [2024-06-14 14:30:33,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:33,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:30:33,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:33,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:30:33,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:30:33,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:30:33,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 241 transitions, 2957 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:33,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:33,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:30:33,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:34,271 INFO L124 PetriNetUnfolderBase]: 669/1150 cut-off events. [2024-06-14 14:30:34,272 INFO L125 PetriNetUnfolderBase]: For 124290/124290 co-relation queries the response was YES. [2024-06-14 14:30:34,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9679 conditions, 1150 events. 669/1150 cut-off events. For 124290/124290 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5703 event pairs, 69 based on Foata normal form. 2/1151 useless extension candidates. Maximal degree in co-relation 9563. Up to 986 conditions per place. [2024-06-14 14:30:34,283 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 210 selfloop transitions, 46 changer transitions 0/258 dead transitions. [2024-06-14 14:30:34,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 258 transitions, 3717 flow [2024-06-14 14:30:34,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:30:34,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:30:34,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-14 14:30:34,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-14 14:30:34,284 INFO L175 Difference]: Start difference. First operand has 252 places, 241 transitions, 2957 flow. Second operand 10 states and 121 transitions. [2024-06-14 14:30:34,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 258 transitions, 3717 flow [2024-06-14 14:30:34,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 258 transitions, 3419 flow, removed 56 selfloop flow, removed 8 redundant places. [2024-06-14 14:30:34,580 INFO L231 Difference]: Finished difference. Result has 254 places, 243 transitions, 2816 flow [2024-06-14 14:30:34,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2665, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2816, PETRI_PLACES=254, PETRI_TRANSITIONS=243} [2024-06-14 14:30:34,580 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 223 predicate places. [2024-06-14 14:30:34,580 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 243 transitions, 2816 flow [2024-06-14 14:30:34,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:34,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:34,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:34,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-14 14:30:34,581 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:30:34,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:34,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1200860752, now seen corresponding path program 9 times [2024-06-14 14:30:34,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:34,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881145827] [2024-06-14 14:30:34,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:34,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:40,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:40,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:40,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881145827] [2024-06-14 14:30:40,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881145827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:40,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:40,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:30:40,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878002636] [2024-06-14 14:30:40,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:40,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:30:40,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:40,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:30:40,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:30:40,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:30:40,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 243 transitions, 2816 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:40,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:40,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:30:40,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:41,258 INFO L124 PetriNetUnfolderBase]: 667/1147 cut-off events. [2024-06-14 14:30:41,258 INFO L125 PetriNetUnfolderBase]: For 119770/119770 co-relation queries the response was YES. [2024-06-14 14:30:41,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9302 conditions, 1147 events. 667/1147 cut-off events. For 119770/119770 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5655 event pairs, 82 based on Foata normal form. 1/1147 useless extension candidates. Maximal degree in co-relation 9186. Up to 1049 conditions per place. [2024-06-14 14:30:41,271 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 216 selfloop transitions, 36 changer transitions 0/254 dead transitions. [2024-06-14 14:30:41,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 254 transitions, 3348 flow [2024-06-14 14:30:41,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:30:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:30:41,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-14 14:30:41,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-14 14:30:41,274 INFO L175 Difference]: Start difference. First operand has 254 places, 243 transitions, 2816 flow. Second operand 10 states and 125 transitions. [2024-06-14 14:30:41,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 254 transitions, 3348 flow [2024-06-14 14:30:41,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 254 transitions, 3103 flow, removed 32 selfloop flow, removed 10 redundant places. [2024-06-14 14:30:41,558 INFO L231 Difference]: Finished difference. Result has 254 places, 243 transitions, 2648 flow [2024-06-14 14:30:41,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2571, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2648, PETRI_PLACES=254, PETRI_TRANSITIONS=243} [2024-06-14 14:30:41,558 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 223 predicate places. [2024-06-14 14:30:41,559 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 243 transitions, 2648 flow [2024-06-14 14:30:41,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:41,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:41,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:30:41,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-14 14:30:41,559 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:30:41,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:41,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1251148262, now seen corresponding path program 16 times [2024-06-14 14:30:41,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:41,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879670044] [2024-06-14 14:30:41,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:41,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:47,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:47,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879670044] [2024-06-14 14:30:47,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879670044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:47,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:47,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:30:47,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166937573] [2024-06-14 14:30:47,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:47,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:30:47,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:47,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:30:47,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:30:48,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:30:48,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 243 transitions, 2648 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:48,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:48,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:30:48,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:48,597 INFO L124 PetriNetUnfolderBase]: 673/1157 cut-off events. [2024-06-14 14:30:48,597 INFO L125 PetriNetUnfolderBase]: For 124497/124497 co-relation queries the response was YES. [2024-06-14 14:30:48,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9105 conditions, 1157 events. 673/1157 cut-off events. For 124497/124497 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5703 event pairs, 72 based on Foata normal form. 2/1158 useless extension candidates. Maximal degree in co-relation 8991. Up to 877 conditions per place. [2024-06-14 14:30:48,607 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 196 selfloop transitions, 64 changer transitions 0/262 dead transitions. [2024-06-14 14:30:48,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 262 transitions, 3696 flow [2024-06-14 14:30:48,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:30:48,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:30:48,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-14 14:30:48,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-14 14:30:48,610 INFO L175 Difference]: Start difference. First operand has 254 places, 243 transitions, 2648 flow. Second operand 10 states and 126 transitions. [2024-06-14 14:30:48,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 262 transitions, 3696 flow [2024-06-14 14:30:48,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 262 transitions, 3529 flow, removed 21 selfloop flow, removed 11 redundant places. [2024-06-14 14:30:48,967 INFO L231 Difference]: Finished difference. Result has 253 places, 245 transitions, 2646 flow [2024-06-14 14:30:48,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2481, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2646, PETRI_PLACES=253, PETRI_TRANSITIONS=245} [2024-06-14 14:30:48,968 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 222 predicate places. [2024-06-14 14:30:48,968 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 245 transitions, 2646 flow [2024-06-14 14:30:48,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:48,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:48,968 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 14:30:48,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-14 14:30:48,968 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:30:48,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1967309447, now seen corresponding path program 1 times [2024-06-14 14:30:48,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:48,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517881588] [2024-06-14 14:30:48,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:48,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:30:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:30:55,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:30:55,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517881588] [2024-06-14 14:30:55,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517881588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:30:55,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:30:55,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:30:55,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521763971] [2024-06-14 14:30:55,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:30:55,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:30:55,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:30:55,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:30:55,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:30:55,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:30:55,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 245 transitions, 2646 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:55,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:30:55,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:30:55,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:30:56,226 INFO L124 PetriNetUnfolderBase]: 684/1178 cut-off events. [2024-06-14 14:30:56,227 INFO L125 PetriNetUnfolderBase]: For 135040/135040 co-relation queries the response was YES. [2024-06-14 14:30:56,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9336 conditions, 1178 events. 684/1178 cut-off events. For 135040/135040 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5841 event pairs, 75 based on Foata normal form. 2/1179 useless extension candidates. Maximal degree in co-relation 9223. Up to 1053 conditions per place. [2024-06-14 14:30:56,239 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 245 selfloop transitions, 27 changer transitions 0/274 dead transitions. [2024-06-14 14:30:56,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 274 transitions, 3434 flow [2024-06-14 14:30:56,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:30:56,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:30:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-14 14:30:56,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-14 14:30:56,241 INFO L175 Difference]: Start difference. First operand has 253 places, 245 transitions, 2646 flow. Second operand 12 states and 141 transitions. [2024-06-14 14:30:56,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 274 transitions, 3434 flow [2024-06-14 14:30:56,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 274 transitions, 3250 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-14 14:30:56,537 INFO L231 Difference]: Finished difference. Result has 255 places, 247 transitions, 2542 flow [2024-06-14 14:30:56,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2462, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2542, PETRI_PLACES=255, PETRI_TRANSITIONS=247} [2024-06-14 14:30:56,538 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 224 predicate places. [2024-06-14 14:30:56,538 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 247 transitions, 2542 flow [2024-06-14 14:30:56,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:30:56,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:30:56,538 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 14:30:56,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-14 14:30:56,539 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:30:56,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:30:56,539 INFO L85 PathProgramCache]: Analyzing trace with hash -659010083, now seen corresponding path program 2 times [2024-06-14 14:30:56,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:30:56,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309085775] [2024-06-14 14:30:56,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:30:56,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:30:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:04,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:04,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:04,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309085775] [2024-06-14 14:31:04,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309085775] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:04,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:04,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:31:04,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568345087] [2024-06-14 14:31:04,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:04,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:31:04,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:04,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:31:04,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:31:04,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:31:04,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 247 transitions, 2542 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:04,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:04,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:31:04,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:04,914 INFO L124 PetriNetUnfolderBase]: 688/1186 cut-off events. [2024-06-14 14:31:04,914 INFO L125 PetriNetUnfolderBase]: For 137874/137874 co-relation queries the response was YES. [2024-06-14 14:31:04,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9131 conditions, 1186 events. 688/1186 cut-off events. For 137874/137874 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5924 event pairs, 93 based on Foata normal form. 2/1187 useless extension candidates. Maximal degree in co-relation 9020. Up to 1114 conditions per place. [2024-06-14 14:31:04,926 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 244 selfloop transitions, 26 changer transitions 0/272 dead transitions. [2024-06-14 14:31:04,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 272 transitions, 3160 flow [2024-06-14 14:31:04,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:31:04,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:31:04,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 139 transitions. [2024-06-14 14:31:04,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3619791666666667 [2024-06-14 14:31:04,928 INFO L175 Difference]: Start difference. First operand has 255 places, 247 transitions, 2542 flow. Second operand 12 states and 139 transitions. [2024-06-14 14:31:04,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 272 transitions, 3160 flow [2024-06-14 14:31:05,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 272 transitions, 3110 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 14:31:05,244 INFO L231 Difference]: Finished difference. Result has 259 places, 248 transitions, 2562 flow [2024-06-14 14:31:05,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2496, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2562, PETRI_PLACES=259, PETRI_TRANSITIONS=248} [2024-06-14 14:31:05,245 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 228 predicate places. [2024-06-14 14:31:05,245 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 248 transitions, 2562 flow [2024-06-14 14:31:05,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:05,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:05,245 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 14:31:05,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-14 14:31:05,246 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:31:05,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:05,246 INFO L85 PathProgramCache]: Analyzing trace with hash -659013803, now seen corresponding path program 3 times [2024-06-14 14:31:05,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:05,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277196312] [2024-06-14 14:31:05,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:05,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:11,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:11,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:11,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277196312] [2024-06-14 14:31:11,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277196312] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:11,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:11,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:31:11,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637486770] [2024-06-14 14:31:11,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:11,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:31:11,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:11,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:31:11,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:31:11,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:31:11,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 248 transitions, 2562 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:11,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:11,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:31:11,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:12,081 INFO L124 PetriNetUnfolderBase]: 692/1194 cut-off events. [2024-06-14 14:31:12,081 INFO L125 PetriNetUnfolderBase]: For 141684/141684 co-relation queries the response was YES. [2024-06-14 14:31:12,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9216 conditions, 1194 events. 692/1194 cut-off events. For 141684/141684 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5964 event pairs, 91 based on Foata normal form. 2/1195 useless extension candidates. Maximal degree in co-relation 9103. Up to 1095 conditions per place. [2024-06-14 14:31:12,093 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 243 selfloop transitions, 25 changer transitions 0/270 dead transitions. [2024-06-14 14:31:12,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 270 transitions, 3320 flow [2024-06-14 14:31:12,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:31:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:31:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-14 14:31:12,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 14:31:12,095 INFO L175 Difference]: Start difference. First operand has 259 places, 248 transitions, 2562 flow. Second operand 10 states and 120 transitions. [2024-06-14 14:31:12,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 270 transitions, 3320 flow [2024-06-14 14:31:12,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 270 transitions, 3266 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-14 14:31:12,396 INFO L231 Difference]: Finished difference. Result has 259 places, 249 transitions, 2572 flow [2024-06-14 14:31:12,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2508, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2572, PETRI_PLACES=259, PETRI_TRANSITIONS=249} [2024-06-14 14:31:12,402 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 228 predicate places. [2024-06-14 14:31:12,402 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 249 transitions, 2572 flow [2024-06-14 14:31:12,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:12,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:12,403 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 14:31:12,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-14 14:31:12,403 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:31:12,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:12,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1969187272, now seen corresponding path program 1 times [2024-06-14 14:31:12,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:12,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694801356] [2024-06-14 14:31:12,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:12,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:17,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:17,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:17,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694801356] [2024-06-14 14:31:17,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694801356] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:17,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:17,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:31:17,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603281126] [2024-06-14 14:31:17,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:17,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:31:17,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:17,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:31:17,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:31:17,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:31:17,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 249 transitions, 2572 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:17,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:17,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:31:17,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:18,453 INFO L124 PetriNetUnfolderBase]: 698/1204 cut-off events. [2024-06-14 14:31:18,453 INFO L125 PetriNetUnfolderBase]: For 145495/145495 co-relation queries the response was YES. [2024-06-14 14:31:18,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9314 conditions, 1204 events. 698/1204 cut-off events. For 145495/145495 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6050 event pairs, 92 based on Foata normal form. 2/1205 useless extension candidates. Maximal degree in co-relation 9200. Up to 1111 conditions per place. [2024-06-14 14:31:18,465 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 248 selfloop transitions, 28 changer transitions 0/278 dead transitions. [2024-06-14 14:31:18,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 278 transitions, 3388 flow [2024-06-14 14:31:18,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:31:18,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:31:18,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 157 transitions. [2024-06-14 14:31:18,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4088541666666667 [2024-06-14 14:31:18,466 INFO L175 Difference]: Start difference. First operand has 259 places, 249 transitions, 2572 flow. Second operand 12 states and 157 transitions. [2024-06-14 14:31:18,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 278 transitions, 3388 flow [2024-06-14 14:31:18,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 278 transitions, 3332 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-14 14:31:18,777 INFO L231 Difference]: Finished difference. Result has 263 places, 251 transitions, 2605 flow [2024-06-14 14:31:18,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2516, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2605, PETRI_PLACES=263, PETRI_TRANSITIONS=251} [2024-06-14 14:31:18,778 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 232 predicate places. [2024-06-14 14:31:18,778 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 251 transitions, 2605 flow [2024-06-14 14:31:18,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:18,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:18,778 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 14:31:18,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-14 14:31:18,778 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:31:18,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:18,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2056023232, now seen corresponding path program 2 times [2024-06-14 14:31:18,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:18,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859306190] [2024-06-14 14:31:18,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:18,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:25,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:25,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:25,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859306190] [2024-06-14 14:31:25,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859306190] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:25,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:25,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:31:25,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127538967] [2024-06-14 14:31:25,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:25,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:31:25,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:25,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:31:25,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:31:25,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:31:25,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 251 transitions, 2605 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:25,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:25,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:31:25,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:26,439 INFO L124 PetriNetUnfolderBase]: 714/1230 cut-off events. [2024-06-14 14:31:26,439 INFO L125 PetriNetUnfolderBase]: For 155654/155654 co-relation queries the response was YES. [2024-06-14 14:31:26,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9667 conditions, 1230 events. 714/1230 cut-off events. For 155654/155654 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6189 event pairs, 92 based on Foata normal form. 2/1231 useless extension candidates. Maximal degree in co-relation 9552. Up to 1162 conditions per place. [2024-06-14 14:31:26,450 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 254 selfloop transitions, 22 changer transitions 0/278 dead transitions. [2024-06-14 14:31:26,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 278 transitions, 3447 flow [2024-06-14 14:31:26,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:31:26,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:31:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-14 14:31:26,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3693181818181818 [2024-06-14 14:31:26,451 INFO L175 Difference]: Start difference. First operand has 263 places, 251 transitions, 2605 flow. Second operand 11 states and 130 transitions. [2024-06-14 14:31:26,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 278 transitions, 3447 flow [2024-06-14 14:31:26,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 278 transitions, 3365 flow, removed 18 selfloop flow, removed 9 redundant places. [2024-06-14 14:31:26,807 INFO L231 Difference]: Finished difference. Result has 265 places, 255 transitions, 2640 flow [2024-06-14 14:31:26,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2539, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2640, PETRI_PLACES=265, PETRI_TRANSITIONS=255} [2024-06-14 14:31:26,808 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 234 predicate places. [2024-06-14 14:31:26,808 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 255 transitions, 2640 flow [2024-06-14 14:31:26,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:26,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:26,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:31:26,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-14 14:31:26,809 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:31:26,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:26,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2055878927, now seen corresponding path program 4 times [2024-06-14 14:31:26,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:26,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711815489] [2024-06-14 14:31:26,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:26,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:32,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:32,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711815489] [2024-06-14 14:31:32,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711815489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:32,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:32,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:31:32,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930686904] [2024-06-14 14:31:32,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:32,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:31:32,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:32,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:31:32,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:31:33,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:31:33,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 255 transitions, 2640 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:33,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:33,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:31:33,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:33,781 INFO L124 PetriNetUnfolderBase]: 718/1238 cut-off events. [2024-06-14 14:31:33,781 INFO L125 PetriNetUnfolderBase]: For 159617/159617 co-relation queries the response was YES. [2024-06-14 14:31:33,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9698 conditions, 1238 events. 718/1238 cut-off events. For 159617/159617 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6257 event pairs, 95 based on Foata normal form. 2/1239 useless extension candidates. Maximal degree in co-relation 9582. Up to 1181 conditions per place. [2024-06-14 14:31:33,793 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 253 selfloop transitions, 21 changer transitions 0/276 dead transitions. [2024-06-14 14:31:33,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 276 transitions, 3252 flow [2024-06-14 14:31:33,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:31:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:31:33,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-14 14:31:33,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35795454545454547 [2024-06-14 14:31:33,812 INFO L175 Difference]: Start difference. First operand has 265 places, 255 transitions, 2640 flow. Second operand 11 states and 126 transitions. [2024-06-14 14:31:33,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 276 transitions, 3252 flow [2024-06-14 14:31:34,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 276 transitions, 3217 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-14 14:31:34,218 INFO L231 Difference]: Finished difference. Result has 269 places, 256 transitions, 2663 flow [2024-06-14 14:31:34,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2605, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2663, PETRI_PLACES=269, PETRI_TRANSITIONS=256} [2024-06-14 14:31:34,219 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 238 predicate places. [2024-06-14 14:31:34,219 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 256 transitions, 2663 flow [2024-06-14 14:31:34,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:34,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:34,220 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 14:31:34,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-14 14:31:34,221 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:31:34,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:34,221 INFO L85 PathProgramCache]: Analyzing trace with hash -256941880, now seen corresponding path program 3 times [2024-06-14 14:31:34,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:34,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028353782] [2024-06-14 14:31:34,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:34,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:41,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:41,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:41,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028353782] [2024-06-14 14:31:41,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028353782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:41,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:41,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:31:41,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8208579] [2024-06-14 14:31:41,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:41,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:31:41,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:41,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:31:41,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:31:41,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:31:41,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 256 transitions, 2663 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:41,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:41,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:31:41,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:42,195 INFO L124 PetriNetUnfolderBase]: 714/1232 cut-off events. [2024-06-14 14:31:42,196 INFO L125 PetriNetUnfolderBase]: For 156697/156697 co-relation queries the response was YES. [2024-06-14 14:31:42,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9577 conditions, 1232 events. 714/1232 cut-off events. For 156697/156697 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6234 event pairs, 92 based on Foata normal form. 2/1233 useless extension candidates. Maximal degree in co-relation 9459. Up to 1176 conditions per place. [2024-06-14 14:31:42,206 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 256 selfloop transitions, 19 changer transitions 0/277 dead transitions. [2024-06-14 14:31:42,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 277 transitions, 3273 flow [2024-06-14 14:31:42,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:31:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:31:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 126 transitions. [2024-06-14 14:31:42,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35795454545454547 [2024-06-14 14:31:42,208 INFO L175 Difference]: Start difference. First operand has 269 places, 256 transitions, 2663 flow. Second operand 11 states and 126 transitions. [2024-06-14 14:31:42,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 277 transitions, 3273 flow [2024-06-14 14:31:42,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 277 transitions, 3207 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-14 14:31:42,592 INFO L231 Difference]: Finished difference. Result has 270 places, 256 transitions, 2640 flow [2024-06-14 14:31:42,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2597, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2640, PETRI_PLACES=270, PETRI_TRANSITIONS=256} [2024-06-14 14:31:42,593 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 239 predicate places. [2024-06-14 14:31:42,593 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 256 transitions, 2640 flow [2024-06-14 14:31:42,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:42,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:42,594 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 14:31:42,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-14 14:31:42,594 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:31:42,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:42,594 INFO L85 PathProgramCache]: Analyzing trace with hash -572174123, now seen corresponding path program 5 times [2024-06-14 14:31:42,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:42,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090567025] [2024-06-14 14:31:42,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:42,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:49,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:49,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090567025] [2024-06-14 14:31:49,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090567025] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:49,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:49,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:31:49,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612843452] [2024-06-14 14:31:49,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:49,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:31:49,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:49,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:31:49,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:31:49,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:31:49,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 256 transitions, 2640 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:49,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:49,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:31:49,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:49,934 INFO L124 PetriNetUnfolderBase]: 711/1227 cut-off events. [2024-06-14 14:31:49,935 INFO L125 PetriNetUnfolderBase]: For 153589/153589 co-relation queries the response was YES. [2024-06-14 14:31:49,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9405 conditions, 1227 events. 711/1227 cut-off events. For 153589/153589 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6211 event pairs, 93 based on Foata normal form. 2/1228 useless extension candidates. Maximal degree in co-relation 9287. Up to 1176 conditions per place. [2024-06-14 14:31:49,947 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 256 selfloop transitions, 18 changer transitions 0/276 dead transitions. [2024-06-14 14:31:49,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 276 transitions, 3242 flow [2024-06-14 14:31:49,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:31:49,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:31:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 124 transitions. [2024-06-14 14:31:49,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-14 14:31:49,948 INFO L175 Difference]: Start difference. First operand has 270 places, 256 transitions, 2640 flow. Second operand 11 states and 124 transitions. [2024-06-14 14:31:49,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 276 transitions, 3242 flow [2024-06-14 14:31:50,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 276 transitions, 3195 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-14 14:31:50,344 INFO L231 Difference]: Finished difference. Result has 271 places, 256 transitions, 2633 flow [2024-06-14 14:31:50,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2593, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2633, PETRI_PLACES=271, PETRI_TRANSITIONS=256} [2024-06-14 14:31:50,344 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 240 predicate places. [2024-06-14 14:31:50,345 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 256 transitions, 2633 flow [2024-06-14 14:31:50,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:50,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:50,345 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 14:31:50,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-14 14:31:50,345 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:31:50,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:50,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2055879082, now seen corresponding path program 4 times [2024-06-14 14:31:50,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:50,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249459373] [2024-06-14 14:31:50,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:50,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:31:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:31:56,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:31:56,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249459373] [2024-06-14 14:31:56,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249459373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:31:56,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:31:56,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:31:56,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143301795] [2024-06-14 14:31:56,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:31:56,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:31:56,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:31:56,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:31:56,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:31:56,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:31:56,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 256 transitions, 2633 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:56,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:31:56,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:31:56,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:31:57,356 INFO L124 PetriNetUnfolderBase]: 707/1221 cut-off events. [2024-06-14 14:31:57,356 INFO L125 PetriNetUnfolderBase]: For 150108/150108 co-relation queries the response was YES. [2024-06-14 14:31:57,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9238 conditions, 1221 events. 707/1221 cut-off events. For 150108/150108 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6163 event pairs, 90 based on Foata normal form. 2/1222 useless extension candidates. Maximal degree in co-relation 9119. Up to 1144 conditions per place. [2024-06-14 14:31:57,368 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 250 selfloop transitions, 26 changer transitions 0/278 dead transitions. [2024-06-14 14:31:57,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 278 transitions, 3249 flow [2024-06-14 14:31:57,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:31:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:31:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 131 transitions. [2024-06-14 14:31:57,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721590909090909 [2024-06-14 14:31:57,370 INFO L175 Difference]: Start difference. First operand has 271 places, 256 transitions, 2633 flow. Second operand 11 states and 131 transitions. [2024-06-14 14:31:57,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 278 transitions, 3249 flow [2024-06-14 14:31:57,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 278 transitions, 3192 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-14 14:31:57,754 INFO L231 Difference]: Finished difference. Result has 272 places, 256 transitions, 2633 flow [2024-06-14 14:31:57,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2576, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2633, PETRI_PLACES=272, PETRI_TRANSITIONS=256} [2024-06-14 14:31:57,754 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 241 predicate places. [2024-06-14 14:31:57,755 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 256 transitions, 2633 flow [2024-06-14 14:31:57,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:31:57,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:31:57,755 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 14:31:57,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-14 14:31:57,755 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:31:57,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:31:57,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1287537288, now seen corresponding path program 1 times [2024-06-14 14:31:57,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:31:57,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430699374] [2024-06-14 14:31:57,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:31:57,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:31:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:06,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:06,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:06,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430699374] [2024-06-14 14:32:06,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430699374] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:06,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:06,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:32:06,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47569002] [2024-06-14 14:32:06,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:06,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:32:06,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:06,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:32:06,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:32:06,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:32:06,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 256 transitions, 2633 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:06,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:06,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:32:06,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:06,873 INFO L124 PetriNetUnfolderBase]: 711/1229 cut-off events. [2024-06-14 14:32:06,873 INFO L125 PetriNetUnfolderBase]: For 153659/153659 co-relation queries the response was YES. [2024-06-14 14:32:06,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9301 conditions, 1229 events. 711/1229 cut-off events. For 153659/153659 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6239 event pairs, 64 based on Foata normal form. 2/1230 useless extension candidates. Maximal degree in co-relation 9181. Up to 1070 conditions per place. [2024-06-14 14:32:06,887 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 226 selfloop transitions, 48 changer transitions 0/276 dead transitions. [2024-06-14 14:32:06,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 276 transitions, 3241 flow [2024-06-14 14:32:06,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:32:06,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:32:06,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-14 14:32:06,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-14 14:32:06,889 INFO L175 Difference]: Start difference. First operand has 272 places, 256 transitions, 2633 flow. Second operand 10 states and 133 transitions. [2024-06-14 14:32:06,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 276 transitions, 3241 flow [2024-06-14 14:32:07,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 276 transitions, 3111 flow, removed 3 selfloop flow, removed 13 redundant places. [2024-06-14 14:32:07,290 INFO L231 Difference]: Finished difference. Result has 269 places, 257 transitions, 2611 flow [2024-06-14 14:32:07,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2503, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2611, PETRI_PLACES=269, PETRI_TRANSITIONS=257} [2024-06-14 14:32:07,291 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 238 predicate places. [2024-06-14 14:32:07,291 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 257 transitions, 2611 flow [2024-06-14 14:32:07,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:07,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:07,292 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 14:32:07,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-14 14:32:07,292 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:32:07,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:07,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1340651976, now seen corresponding path program 5 times [2024-06-14 14:32:07,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:07,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809375070] [2024-06-14 14:32:07,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:07,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:16,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 14:32:16,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:16,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809375070] [2024-06-14 14:32:16,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809375070] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:16,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:16,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:32:16,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346756930] [2024-06-14 14:32:16,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:16,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:32:16,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:16,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:32:16,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:32:17,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:32:17,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 257 transitions, 2611 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:17,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:17,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:32:17,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:17,945 INFO L124 PetriNetUnfolderBase]: 717/1239 cut-off events. [2024-06-14 14:32:17,945 INFO L125 PetriNetUnfolderBase]: For 156985/156985 co-relation queries the response was YES. [2024-06-14 14:32:17,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9396 conditions, 1239 events. 717/1239 cut-off events. For 156985/156985 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6265 event pairs, 68 based on Foata normal form. 2/1240 useless extension candidates. Maximal degree in co-relation 9276. Up to 598 conditions per place. [2024-06-14 14:32:17,956 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 145 selfloop transitions, 136 changer transitions 0/283 dead transitions. [2024-06-14 14:32:17,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 283 transitions, 3609 flow [2024-06-14 14:32:17,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:32:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:32:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-14 14:32:17,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4147727272727273 [2024-06-14 14:32:17,958 INFO L175 Difference]: Start difference. First operand has 269 places, 257 transitions, 2611 flow. Second operand 11 states and 146 transitions. [2024-06-14 14:32:17,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 283 transitions, 3609 flow [2024-06-14 14:32:18,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 283 transitions, 3511 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 14:32:18,356 INFO L231 Difference]: Finished difference. Result has 272 places, 259 transitions, 2812 flow [2024-06-14 14:32:18,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2513, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2812, PETRI_PLACES=272, PETRI_TRANSITIONS=259} [2024-06-14 14:32:18,357 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 241 predicate places. [2024-06-14 14:32:18,357 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 259 transitions, 2812 flow [2024-06-14 14:32:18,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:18,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:18,357 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 14:32:18,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-14 14:32:18,357 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:32:18,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:18,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1293263019, now seen corresponding path program 6 times [2024-06-14 14:32:18,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:18,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219472153] [2024-06-14 14:32:18,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:18,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:26,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:26,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219472153] [2024-06-14 14:32:26,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219472153] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:26,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:26,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:32:26,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895068642] [2024-06-14 14:32:26,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:26,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:32:26,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:26,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:32:26,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:32:26,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:32:26,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 259 transitions, 2812 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:26,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:26,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:32:26,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:27,057 INFO L124 PetriNetUnfolderBase]: 728/1260 cut-off events. [2024-06-14 14:32:27,057 INFO L125 PetriNetUnfolderBase]: For 169106/169106 co-relation queries the response was YES. [2024-06-14 14:32:27,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9955 conditions, 1260 events. 728/1260 cut-off events. For 169106/169106 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 6434 event pairs, 79 based on Foata normal form. 2/1261 useless extension candidates. Maximal degree in co-relation 9834. Up to 1032 conditions per place. [2024-06-14 14:32:27,071 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 213 selfloop transitions, 67 changer transitions 0/282 dead transitions. [2024-06-14 14:32:27,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 282 transitions, 3626 flow [2024-06-14 14:32:27,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:32:27,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:32:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-14 14:32:27,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-14 14:32:27,074 INFO L175 Difference]: Start difference. First operand has 272 places, 259 transitions, 2812 flow. Second operand 11 states and 138 transitions. [2024-06-14 14:32:27,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 282 transitions, 3626 flow [2024-06-14 14:32:27,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 282 transitions, 3372 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-14 14:32:27,513 INFO L231 Difference]: Finished difference. Result has 275 places, 261 transitions, 2722 flow [2024-06-14 14:32:27,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2558, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2722, PETRI_PLACES=275, PETRI_TRANSITIONS=261} [2024-06-14 14:32:27,513 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 244 predicate places. [2024-06-14 14:32:27,513 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 261 transitions, 2722 flow [2024-06-14 14:32:27,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:27,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:27,514 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 14:32:27,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-14 14:32:27,514 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:32:27,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:27,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1293109414, now seen corresponding path program 6 times [2024-06-14 14:32:27,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:27,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221764503] [2024-06-14 14:32:27,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:27,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:36,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:36,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221764503] [2024-06-14 14:32:36,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221764503] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:36,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:36,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:32:36,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597793027] [2024-06-14 14:32:36,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:36,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:32:36,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:36,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:32:36,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:32:36,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:32:36,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 261 transitions, 2722 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:36,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:36,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:32:36,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:37,284 INFO L124 PetriNetUnfolderBase]: 724/1254 cut-off events. [2024-06-14 14:32:37,284 INFO L125 PetriNetUnfolderBase]: For 165595/165595 co-relation queries the response was YES. [2024-06-14 14:32:37,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9597 conditions, 1254 events. 724/1254 cut-off events. For 165595/165595 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 6464 event pairs, 56 based on Foata normal form. 2/1255 useless extension candidates. Maximal degree in co-relation 9475. Up to 910 conditions per place. [2024-06-14 14:32:37,296 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 195 selfloop transitions, 87 changer transitions 0/284 dead transitions. [2024-06-14 14:32:37,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 284 transitions, 3361 flow [2024-06-14 14:32:37,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:32:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:32:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-06-14 14:32:37,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4005681818181818 [2024-06-14 14:32:37,297 INFO L175 Difference]: Start difference. First operand has 275 places, 261 transitions, 2722 flow. Second operand 11 states and 141 transitions. [2024-06-14 14:32:37,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 284 transitions, 3361 flow [2024-06-14 14:32:37,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 284 transitions, 3238 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-14 14:32:37,700 INFO L231 Difference]: Finished difference. Result has 280 places, 262 transitions, 2787 flow [2024-06-14 14:32:37,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2602, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2787, PETRI_PLACES=280, PETRI_TRANSITIONS=262} [2024-06-14 14:32:37,701 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 249 predicate places. [2024-06-14 14:32:37,701 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 262 transitions, 2787 flow [2024-06-14 14:32:37,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:37,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:37,701 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 14:32:37,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-14 14:32:37,701 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:32:37,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:37,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1293259299, now seen corresponding path program 7 times [2024-06-14 14:32:37,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:37,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795334123] [2024-06-14 14:32:37,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:37,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:43,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:43,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:43,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795334123] [2024-06-14 14:32:43,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795334123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:43,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:43,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:32:43,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14184810] [2024-06-14 14:32:43,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:43,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:32:43,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:43,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:32:43,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:32:43,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:32:43,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 262 transitions, 2787 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:43,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:43,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:32:43,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:44,394 INFO L124 PetriNetUnfolderBase]: 731/1267 cut-off events. [2024-06-14 14:32:44,394 INFO L125 PetriNetUnfolderBase]: For 168425/168425 co-relation queries the response was YES. [2024-06-14 14:32:44,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9807 conditions, 1267 events. 731/1267 cut-off events. For 168425/168425 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 6517 event pairs, 80 based on Foata normal form. 2/1268 useless extension candidates. Maximal degree in co-relation 9684. Up to 1057 conditions per place. [2024-06-14 14:32:44,413 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 213 selfloop transitions, 69 changer transitions 0/284 dead transitions. [2024-06-14 14:32:44,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 284 transitions, 3432 flow [2024-06-14 14:32:44,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:32:44,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:32:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-14 14:32:44,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-14 14:32:44,415 INFO L175 Difference]: Start difference. First operand has 280 places, 262 transitions, 2787 flow. Second operand 11 states and 136 transitions. [2024-06-14 14:32:44,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 284 transitions, 3432 flow [2024-06-14 14:32:44,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 284 transitions, 3265 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-14 14:32:44,940 INFO L231 Difference]: Finished difference. Result has 284 places, 265 transitions, 2793 flow [2024-06-14 14:32:44,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2622, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2793, PETRI_PLACES=284, PETRI_TRANSITIONS=265} [2024-06-14 14:32:44,940 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 253 predicate places. [2024-06-14 14:32:44,940 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 265 transitions, 2793 flow [2024-06-14 14:32:44,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:44,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:44,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:32:44,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-14 14:32:44,941 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:32:44,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:44,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1340444431, now seen corresponding path program 8 times [2024-06-14 14:32:44,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:44,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424678179] [2024-06-14 14:32:44,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:44,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:51,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:51,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424678179] [2024-06-14 14:32:51,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424678179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:51,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:51,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:32:51,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022087044] [2024-06-14 14:32:51,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:51,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:32:51,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:51,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:32:51,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:32:51,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:32:51,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 265 transitions, 2793 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:51,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:51,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:32:51,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:52,093 INFO L124 PetriNetUnfolderBase]: 735/1275 cut-off events. [2024-06-14 14:32:52,093 INFO L125 PetriNetUnfolderBase]: For 172149/172149 co-relation queries the response was YES. [2024-06-14 14:32:52,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9824 conditions, 1275 events. 735/1275 cut-off events. For 172149/172149 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6570 event pairs, 82 based on Foata normal form. 2/1276 useless extension candidates. Maximal degree in co-relation 9700. Up to 1041 conditions per place. [2024-06-14 14:32:52,106 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 211 selfloop transitions, 74 changer transitions 0/287 dead transitions. [2024-06-14 14:32:52,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 287 transitions, 3449 flow [2024-06-14 14:32:52,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:32:52,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:32:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-14 14:32:52,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-14 14:32:52,108 INFO L175 Difference]: Start difference. First operand has 284 places, 265 transitions, 2793 flow. Second operand 11 states and 136 transitions. [2024-06-14 14:32:52,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 287 transitions, 3449 flow [2024-06-14 14:32:52,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 287 transitions, 3311 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-14 14:32:52,590 INFO L231 Difference]: Finished difference. Result has 288 places, 268 transitions, 2891 flow [2024-06-14 14:32:52,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2655, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2891, PETRI_PLACES=288, PETRI_TRANSITIONS=268} [2024-06-14 14:32:52,591 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 257 predicate places. [2024-06-14 14:32:52,591 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 268 transitions, 2891 flow [2024-06-14 14:32:52,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:52,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:52,591 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 14:32:52,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-14 14:32:52,592 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 14:32:52,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:52,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1335082051, now seen corresponding path program 9 times [2024-06-14 14:32:52,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:52,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522134002] [2024-06-14 14:32:52,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:52,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:32:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:32:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:32:58,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:32:58,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522134002] [2024-06-14 14:32:58,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522134002] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:32:58,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:32:58,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:32:58,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033509766] [2024-06-14 14:32:58,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:32:58,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:32:58,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:32:58,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:32:58,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:32:59,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:32:59,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 268 transitions, 2891 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:59,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:32:59,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:32:59,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:32:59,543 INFO L124 PetriNetUnfolderBase]: 732/1270 cut-off events. [2024-06-14 14:32:59,544 INFO L125 PetriNetUnfolderBase]: For 168029/168029 co-relation queries the response was YES. [2024-06-14 14:32:59,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9775 conditions, 1270 events. 732/1270 cut-off events. For 168029/168029 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6545 event pairs, 79 based on Foata normal form. 2/1271 useless extension candidates. Maximal degree in co-relation 9649. Up to 933 conditions per place. [2024-06-14 14:32:59,557 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 187 selfloop transitions, 97 changer transitions 0/286 dead transitions. [2024-06-14 14:32:59,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 286 transitions, 3509 flow [2024-06-14 14:32:59,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:32:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:32:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-14 14:32:59,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-14 14:32:59,558 INFO L175 Difference]: Start difference. First operand has 288 places, 268 transitions, 2891 flow. Second operand 10 states and 132 transitions. [2024-06-14 14:32:59,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 286 transitions, 3509 flow [2024-06-14 14:32:59,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 286 transitions, 3376 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 14:32:59,981 INFO L231 Difference]: Finished difference. Result has 289 places, 268 transitions, 2958 flow [2024-06-14 14:32:59,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2758, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2958, PETRI_PLACES=289, PETRI_TRANSITIONS=268} [2024-06-14 14:32:59,982 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 258 predicate places. [2024-06-14 14:32:59,982 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 268 transitions, 2958 flow [2024-06-14 14:32:59,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:32:59,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:32:59,982 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 14:32:59,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-14 14:32:59,983 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 14:32:59,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:32:59,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1287747034, now seen corresponding path program 7 times [2024-06-14 14:32:59,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:32:59,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244820799] [2024-06-14 14:32:59,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:32:59,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:06,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:06,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:06,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244820799] [2024-06-14 14:33:06,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244820799] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:06,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:06,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:33:06,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389634964] [2024-06-14 14:33:06,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:06,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:33:06,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:06,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:33:06,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:33:07,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:33:07,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 268 transitions, 2958 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:07,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:07,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:33:07,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:07,771 INFO L124 PetriNetUnfolderBase]: 728/1264 cut-off events. [2024-06-14 14:33:07,772 INFO L125 PetriNetUnfolderBase]: For 164224/164224 co-relation queries the response was YES. [2024-06-14 14:33:07,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9655 conditions, 1264 events. 728/1264 cut-off events. For 164224/164224 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6549 event pairs, 54 based on Foata normal form. 2/1265 useless extension candidates. Maximal degree in co-relation 9528. Up to 920 conditions per place. [2024-06-14 14:33:07,783 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 200 selfloop transitions, 88 changer transitions 0/290 dead transitions. [2024-06-14 14:33:07,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 290 transitions, 3600 flow [2024-06-14 14:33:07,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:33:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:33:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2024-06-14 14:33:07,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-06-14 14:33:07,784 INFO L175 Difference]: Start difference. First operand has 289 places, 268 transitions, 2958 flow. Second operand 11 states and 140 transitions. [2024-06-14 14:33:07,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 290 transitions, 3600 flow [2024-06-14 14:33:08,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 290 transitions, 3386 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 14:33:08,198 INFO L231 Difference]: Finished difference. Result has 291 places, 268 transitions, 2925 flow [2024-06-14 14:33:08,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2744, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2925, PETRI_PLACES=291, PETRI_TRANSITIONS=268} [2024-06-14 14:33:08,198 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 260 predicate places. [2024-06-14 14:33:08,198 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 268 transitions, 2925 flow [2024-06-14 14:33:08,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:08,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:08,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:08,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-14 14:33:08,199 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 14:33:08,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:08,199 INFO L85 PathProgramCache]: Analyzing trace with hash -253967346, now seen corresponding path program 8 times [2024-06-14 14:33:08,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:08,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811632212] [2024-06-14 14:33:08,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:08,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:14,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:14,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:14,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811632212] [2024-06-14 14:33:14,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811632212] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:14,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:14,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:33:14,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373379049] [2024-06-14 14:33:14,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:14,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:33:14,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:14,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:33:14,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:33:14,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:33:14,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 268 transitions, 2925 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:14,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:14,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:33:14,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:15,291 INFO L124 PetriNetUnfolderBase]: 734/1274 cut-off events. [2024-06-14 14:33:15,291 INFO L125 PetriNetUnfolderBase]: For 163406/163406 co-relation queries the response was YES. [2024-06-14 14:33:15,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9698 conditions, 1274 events. 734/1274 cut-off events. For 163406/163406 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6573 event pairs, 81 based on Foata normal form. 2/1275 useless extension candidates. Maximal degree in co-relation 9570. Up to 1143 conditions per place. [2024-06-14 14:33:15,306 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 250 selfloop transitions, 38 changer transitions 0/290 dead transitions. [2024-06-14 14:33:15,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 290 transitions, 3769 flow [2024-06-14 14:33:15,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:33:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:33:15,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-14 14:33:15,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-14 14:33:15,307 INFO L175 Difference]: Start difference. First operand has 291 places, 268 transitions, 2925 flow. Second operand 11 states and 134 transitions. [2024-06-14 14:33:15,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 290 transitions, 3769 flow [2024-06-14 14:33:15,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 290 transitions, 3533 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-06-14 14:33:15,764 INFO L231 Difference]: Finished difference. Result has 290 places, 270 transitions, 2796 flow [2024-06-14 14:33:15,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2689, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2796, PETRI_PLACES=290, PETRI_TRANSITIONS=270} [2024-06-14 14:33:15,765 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 259 predicate places. [2024-06-14 14:33:15,765 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 270 transitions, 2796 flow [2024-06-14 14:33:15,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:15,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:15,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:15,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-14 14:33:15,765 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 14:33:15,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:15,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1411390577, now seen corresponding path program 10 times [2024-06-14 14:33:15,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:15,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564863145] [2024-06-14 14:33:15,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:22,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:22,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564863145] [2024-06-14 14:33:22,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564863145] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:22,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:22,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:33:22,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412754394] [2024-06-14 14:33:22,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:22,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:33:22,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:22,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:33:22,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:33:22,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:33:22,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 270 transitions, 2796 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:22,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:22,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:33:22,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:23,250 INFO L124 PetriNetUnfolderBase]: 758/1326 cut-off events. [2024-06-14 14:33:23,250 INFO L125 PetriNetUnfolderBase]: For 218345/218345 co-relation queries the response was YES. [2024-06-14 14:33:23,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9779 conditions, 1326 events. 758/1326 cut-off events. For 218345/218345 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6903 event pairs, 84 based on Foata normal form. 14/1339 useless extension candidates. Maximal degree in co-relation 9650. Up to 1163 conditions per place. [2024-06-14 14:33:23,265 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 249 selfloop transitions, 35 changer transitions 9/295 dead transitions. [2024-06-14 14:33:23,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 295 transitions, 3502 flow [2024-06-14 14:33:23,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:33:23,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:33:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-14 14:33:23,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39488636363636365 [2024-06-14 14:33:23,266 INFO L175 Difference]: Start difference. First operand has 290 places, 270 transitions, 2796 flow. Second operand 11 states and 139 transitions. [2024-06-14 14:33:23,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 295 transitions, 3502 flow [2024-06-14 14:33:23,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 295 transitions, 3401 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-14 14:33:23,790 INFO L231 Difference]: Finished difference. Result has 292 places, 269 transitions, 2759 flow [2024-06-14 14:33:23,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2695, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2759, PETRI_PLACES=292, PETRI_TRANSITIONS=269} [2024-06-14 14:33:23,791 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 261 predicate places. [2024-06-14 14:33:23,791 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 269 transitions, 2759 flow [2024-06-14 14:33:23,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:23,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:23,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 14:33:23,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-14 14:33:23,792 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 14:33:23,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:23,793 INFO L85 PathProgramCache]: Analyzing trace with hash -447906756, now seen corresponding path program 9 times [2024-06-14 14:33:23,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:23,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216304610] [2024-06-14 14:33:23,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:23,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:29,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:29,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:29,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216304610] [2024-06-14 14:33:29,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216304610] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:29,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:29,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:33:29,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194089062] [2024-06-14 14:33:29,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:29,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:33:29,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:29,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:33:29,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:33:30,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:33:30,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 269 transitions, 2759 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:30,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:30,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:33:30,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:30,621 INFO L124 PetriNetUnfolderBase]: 742/1300 cut-off events. [2024-06-14 14:33:30,621 INFO L125 PetriNetUnfolderBase]: For 161264/161264 co-relation queries the response was YES. [2024-06-14 14:33:30,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9466 conditions, 1300 events. 742/1300 cut-off events. For 161264/161264 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6777 event pairs, 84 based on Foata normal form. 2/1301 useless extension candidates. Maximal degree in co-relation 9336. Up to 1076 conditions per place. [2024-06-14 14:33:30,634 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 236 selfloop transitions, 54 changer transitions 0/292 dead transitions. [2024-06-14 14:33:30,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 292 transitions, 3969 flow [2024-06-14 14:33:30,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:33:30,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:33:30,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-14 14:33:30,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-14 14:33:30,635 INFO L175 Difference]: Start difference. First operand has 292 places, 269 transitions, 2759 flow. Second operand 11 states and 144 transitions. [2024-06-14 14:33:30,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 292 transitions, 3969 flow [2024-06-14 14:33:31,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 292 transitions, 3879 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-14 14:33:31,158 INFO L231 Difference]: Finished difference. Result has 294 places, 269 transitions, 2782 flow [2024-06-14 14:33:31,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2669, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2782, PETRI_PLACES=294, PETRI_TRANSITIONS=269} [2024-06-14 14:33:31,159 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 263 predicate places. [2024-06-14 14:33:31,159 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 269 transitions, 2782 flow [2024-06-14 14:33:31,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:31,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:31,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:33:31,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-14 14:33:31,160 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 14:33:31,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:31,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1913112806, now seen corresponding path program 2 times [2024-06-14 14:33:31,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:31,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393438726] [2024-06-14 14:33:31,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:31,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:38,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:38,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:38,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393438726] [2024-06-14 14:33:38,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393438726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:38,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:38,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:33:38,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696393654] [2024-06-14 14:33:38,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:38,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:33:38,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:38,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:33:38,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:33:38,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:33:38,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 269 transitions, 2782 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:38,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:38,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:33:38,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:38,684 INFO L124 PetriNetUnfolderBase]: 746/1308 cut-off events. [2024-06-14 14:33:38,684 INFO L125 PetriNetUnfolderBase]: For 164573/164573 co-relation queries the response was YES. [2024-06-14 14:33:38,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9556 conditions, 1308 events. 746/1308 cut-off events. For 164573/164573 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6823 event pairs, 84 based on Foata normal form. 2/1309 useless extension candidates. Maximal degree in co-relation 9425. Up to 1228 conditions per place. [2024-06-14 14:33:38,695 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 257 selfloop transitions, 27 changer transitions 1/287 dead transitions. [2024-06-14 14:33:38,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 287 transitions, 3415 flow [2024-06-14 14:33:38,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:33:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:33:38,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-14 14:33:38,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-14 14:33:38,696 INFO L175 Difference]: Start difference. First operand has 294 places, 269 transitions, 2782 flow. Second operand 10 states and 118 transitions. [2024-06-14 14:33:38,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 287 transitions, 3415 flow [2024-06-14 14:33:39,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 287 transitions, 3255 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-14 14:33:39,196 INFO L231 Difference]: Finished difference. Result has 294 places, 270 transitions, 2695 flow [2024-06-14 14:33:39,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2623, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2695, PETRI_PLACES=294, PETRI_TRANSITIONS=270} [2024-06-14 14:33:39,197 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 263 predicate places. [2024-06-14 14:33:39,197 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 270 transitions, 2695 flow [2024-06-14 14:33:39,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:39,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:39,197 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 14:33:39,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-14 14:33:39,197 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 14:33:39,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:39,198 INFO L85 PathProgramCache]: Analyzing trace with hash -246333410, now seen corresponding path program 3 times [2024-06-14 14:33:39,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:39,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440392074] [2024-06-14 14:33:39,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:39,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:45,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:45,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440392074] [2024-06-14 14:33:45,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440392074] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:45,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:45,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:33:45,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145984137] [2024-06-14 14:33:45,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:45,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:33:45,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:45,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:33:45,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:33:45,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:33:45,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 270 transitions, 2695 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:45,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:45,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:33:45,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:46,015 INFO L124 PetriNetUnfolderBase]: 726/1268 cut-off events. [2024-06-14 14:33:46,015 INFO L125 PetriNetUnfolderBase]: For 167566/167566 co-relation queries the response was YES. [2024-06-14 14:33:46,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9308 conditions, 1268 events. 726/1268 cut-off events. For 167566/167566 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 6594 event pairs, 78 based on Foata normal form. 2/1269 useless extension candidates. Maximal degree in co-relation 9175. Up to 1188 conditions per place. [2024-06-14 14:33:46,029 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 258 selfloop transitions, 27 changer transitions 0/287 dead transitions. [2024-06-14 14:33:46,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 287 transitions, 3317 flow [2024-06-14 14:33:46,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:33:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:33:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-14 14:33:46,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.365625 [2024-06-14 14:33:46,031 INFO L175 Difference]: Start difference. First operand has 294 places, 270 transitions, 2695 flow. Second operand 10 states and 117 transitions. [2024-06-14 14:33:46,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 287 transitions, 3317 flow [2024-06-14 14:33:46,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 287 transitions, 3261 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-14 14:33:46,549 INFO L231 Difference]: Finished difference. Result has 297 places, 271 transitions, 2709 flow [2024-06-14 14:33:46,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2639, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2709, PETRI_PLACES=297, PETRI_TRANSITIONS=271} [2024-06-14 14:33:46,550 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 266 predicate places. [2024-06-14 14:33:46,550 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 271 transitions, 2709 flow [2024-06-14 14:33:46,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:46,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:46,550 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 14:33:46,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-14 14:33:46,550 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 14:33:46,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:46,551 INFO L85 PathProgramCache]: Analyzing trace with hash -253961766, now seen corresponding path program 10 times [2024-06-14 14:33:46,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:46,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153514376] [2024-06-14 14:33:46,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:46,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:33:54,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:33:54,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:33:54,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153514376] [2024-06-14 14:33:54,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153514376] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:33:54,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:33:54,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:33:54,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074180642] [2024-06-14 14:33:54,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:33:54,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:33:54,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:33:54,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:33:54,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:33:54,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:33:54,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 271 transitions, 2709 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:54,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:33:54,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:33:54,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:33:55,099 INFO L124 PetriNetUnfolderBase]: 732/1278 cut-off events. [2024-06-14 14:33:55,100 INFO L125 PetriNetUnfolderBase]: For 171065/171065 co-relation queries the response was YES. [2024-06-14 14:33:55,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9397 conditions, 1278 events. 732/1278 cut-off events. For 171065/171065 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 6657 event pairs, 75 based on Foata normal form. 2/1279 useless extension candidates. Maximal degree in co-relation 9263. Up to 1150 conditions per place. [2024-06-14 14:33:55,112 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 251 selfloop transitions, 40 changer transitions 0/293 dead transitions. [2024-06-14 14:33:55,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 293 transitions, 3565 flow [2024-06-14 14:33:55,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:33:55,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:33:55,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-14 14:33:55,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-14 14:33:55,114 INFO L175 Difference]: Start difference. First operand has 297 places, 271 transitions, 2709 flow. Second operand 11 states and 136 transitions. [2024-06-14 14:33:55,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 293 transitions, 3565 flow [2024-06-14 14:33:55,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 293 transitions, 3505 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 14:33:55,671 INFO L231 Difference]: Finished difference. Result has 300 places, 273 transitions, 2756 flow [2024-06-14 14:33:55,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2649, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2756, PETRI_PLACES=300, PETRI_TRANSITIONS=273} [2024-06-14 14:33:55,672 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 269 predicate places. [2024-06-14 14:33:55,672 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 273 transitions, 2756 flow [2024-06-14 14:33:55,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:33:55,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:33:55,672 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 14:33:55,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-14 14:33:55,673 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 14:33:55,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:33:55,673 INFO L85 PathProgramCache]: Analyzing trace with hash -253752020, now seen corresponding path program 4 times [2024-06-14 14:33:55,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:33:55,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437070233] [2024-06-14 14:33:55,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:33:55,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:33:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:02,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:02,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437070233] [2024-06-14 14:34:02,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437070233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:02,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:02,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:34:02,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013078625] [2024-06-14 14:34:02,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:02,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:34:02,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:02,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:34:02,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:34:02,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:34:02,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 273 transitions, 2756 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:02,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:02,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:34:02,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:03,187 INFO L124 PetriNetUnfolderBase]: 736/1286 cut-off events. [2024-06-14 14:34:03,188 INFO L125 PetriNetUnfolderBase]: For 174773/174773 co-relation queries the response was YES. [2024-06-14 14:34:03,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9497 conditions, 1286 events. 736/1286 cut-off events. For 174773/174773 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6713 event pairs, 79 based on Foata normal form. 2/1287 useless extension candidates. Maximal degree in co-relation 9362. Up to 1206 conditions per place. [2024-06-14 14:34:03,206 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 262 selfloop transitions, 27 changer transitions 0/291 dead transitions. [2024-06-14 14:34:03,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 291 transitions, 3394 flow [2024-06-14 14:34:03,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:34:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:34:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-14 14:34:03,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 14:34:03,207 INFO L175 Difference]: Start difference. First operand has 300 places, 273 transitions, 2756 flow. Second operand 10 states and 120 transitions. [2024-06-14 14:34:03,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 291 transitions, 3394 flow [2024-06-14 14:34:03,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 291 transitions, 3311 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-14 14:34:03,814 INFO L231 Difference]: Finished difference. Result has 302 places, 274 transitions, 2745 flow [2024-06-14 14:34:03,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2673, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2745, PETRI_PLACES=302, PETRI_TRANSITIONS=274} [2024-06-14 14:34:03,820 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 271 predicate places. [2024-06-14 14:34:03,821 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 274 transitions, 2745 flow [2024-06-14 14:34:03,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:03,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:03,821 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 14:34:03,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-14 14:34:03,821 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 14:34:03,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:03,822 INFO L85 PathProgramCache]: Analyzing trace with hash -253759956, now seen corresponding path program 11 times [2024-06-14 14:34:03,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:03,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654988278] [2024-06-14 14:34:03,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:03,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:10,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:10,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654988278] [2024-06-14 14:34:10,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654988278] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:10,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:10,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:34:10,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716131749] [2024-06-14 14:34:10,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:10,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:34:10,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:10,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:34:10,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:34:11,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:34:11,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 274 transitions, 2745 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:11,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:11,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:34:11,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:11,710 INFO L124 PetriNetUnfolderBase]: 732/1280 cut-off events. [2024-06-14 14:34:11,710 INFO L125 PetriNetUnfolderBase]: For 168523/168523 co-relation queries the response was YES. [2024-06-14 14:34:11,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9271 conditions, 1280 events. 732/1280 cut-off events. For 168523/168523 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6705 event pairs, 82 based on Foata normal form. 2/1281 useless extension candidates. Maximal degree in co-relation 9135. Up to 1181 conditions per place. [2024-06-14 14:34:11,724 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 258 selfloop transitions, 33 changer transitions 0/293 dead transitions. [2024-06-14 14:34:11,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 293 transitions, 3383 flow [2024-06-14 14:34:11,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:34:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:34:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-14 14:34:11,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3778409090909091 [2024-06-14 14:34:11,725 INFO L175 Difference]: Start difference. First operand has 302 places, 274 transitions, 2745 flow. Second operand 11 states and 133 transitions. [2024-06-14 14:34:11,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 293 transitions, 3383 flow [2024-06-14 14:34:12,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 293 transitions, 3311 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-14 14:34:12,241 INFO L231 Difference]: Finished difference. Result has 305 places, 274 transitions, 2744 flow [2024-06-14 14:34:12,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2673, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2744, PETRI_PLACES=305, PETRI_TRANSITIONS=274} [2024-06-14 14:34:12,242 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 274 predicate places. [2024-06-14 14:34:12,242 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 274 transitions, 2744 flow [2024-06-14 14:34:12,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:12,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:12,242 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 14:34:12,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-14 14:34:12,243 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 14:34:12,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:12,243 INFO L85 PathProgramCache]: Analyzing trace with hash -447906911, now seen corresponding path program 11 times [2024-06-14 14:34:12,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:12,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875792931] [2024-06-14 14:34:12,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:12,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:18,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:18,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875792931] [2024-06-14 14:34:18,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875792931] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:18,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:18,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:34:18,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466927067] [2024-06-14 14:34:18,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:18,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:34:18,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:18,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:34:18,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:34:18,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:34:18,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 274 transitions, 2744 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:18,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:18,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:34:18,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:19,328 INFO L124 PetriNetUnfolderBase]: 736/1288 cut-off events. [2024-06-14 14:34:19,328 INFO L125 PetriNetUnfolderBase]: For 171930/171930 co-relation queries the response was YES. [2024-06-14 14:34:19,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9338 conditions, 1288 events. 736/1288 cut-off events. For 171930/171930 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 6733 event pairs, 82 based on Foata normal form. 2/1289 useless extension candidates. Maximal degree in co-relation 9201. Up to 1178 conditions per place. [2024-06-14 14:34:19,341 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 248 selfloop transitions, 42 changer transitions 0/292 dead transitions. [2024-06-14 14:34:19,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 292 transitions, 3386 flow [2024-06-14 14:34:19,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:34:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:34:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-14 14:34:19,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806818181818182 [2024-06-14 14:34:19,343 INFO L175 Difference]: Start difference. First operand has 305 places, 274 transitions, 2744 flow. Second operand 11 states and 134 transitions. [2024-06-14 14:34:19,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 292 transitions, 3386 flow [2024-06-14 14:34:19,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 292 transitions, 3302 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-14 14:34:19,863 INFO L231 Difference]: Finished difference. Result has 305 places, 275 transitions, 2766 flow [2024-06-14 14:34:19,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2660, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2766, PETRI_PLACES=305, PETRI_TRANSITIONS=275} [2024-06-14 14:34:19,863 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 274 predicate places. [2024-06-14 14:34:19,863 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 275 transitions, 2766 flow [2024-06-14 14:34:19,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:19,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:19,864 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 14:34:19,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-14 14:34:19,864 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 14:34:19,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:19,864 INFO L85 PathProgramCache]: Analyzing trace with hash -2114671272, now seen corresponding path program 12 times [2024-06-14 14:34:19,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:19,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900103361] [2024-06-14 14:34:19,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:19,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:26,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:26,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900103361] [2024-06-14 14:34:26,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900103361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:26,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:26,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:34:26,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509070543] [2024-06-14 14:34:26,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:26,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:34:26,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:26,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:34:26,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:34:26,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:34:26,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 275 transitions, 2766 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:26,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:26,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:34:26,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:27,612 INFO L124 PetriNetUnfolderBase]: 742/1298 cut-off events. [2024-06-14 14:34:27,612 INFO L125 PetriNetUnfolderBase]: For 175575/175575 co-relation queries the response was YES. [2024-06-14 14:34:27,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9425 conditions, 1298 events. 742/1298 cut-off events. For 175575/175575 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 6828 event pairs, 70 based on Foata normal form. 2/1299 useless extension candidates. Maximal degree in co-relation 9287. Up to 1158 conditions per place. [2024-06-14 14:34:27,627 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 251 selfloop transitions, 44 changer transitions 0/297 dead transitions. [2024-06-14 14:34:27,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 297 transitions, 3438 flow [2024-06-14 14:34:27,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:34:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:34:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-14 14:34:27,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39204545454545453 [2024-06-14 14:34:27,629 INFO L175 Difference]: Start difference. First operand has 305 places, 275 transitions, 2766 flow. Second operand 11 states and 138 transitions. [2024-06-14 14:34:27,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 297 transitions, 3438 flow [2024-06-14 14:34:28,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 297 transitions, 3329 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-14 14:34:28,134 INFO L231 Difference]: Finished difference. Result has 306 places, 277 transitions, 2776 flow [2024-06-14 14:34:28,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2657, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2776, PETRI_PLACES=306, PETRI_TRANSITIONS=277} [2024-06-14 14:34:28,135 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 275 predicate places. [2024-06-14 14:34:28,135 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 277 transitions, 2776 flow [2024-06-14 14:34:28,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:28,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:28,135 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 14:34:28,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-14 14:34:28,136 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 14:34:28,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:28,136 INFO L85 PathProgramCache]: Analyzing trace with hash -2114461526, now seen corresponding path program 5 times [2024-06-14 14:34:28,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:28,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356750381] [2024-06-14 14:34:28,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:28,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:35,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 14:34:35,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:35,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356750381] [2024-06-14 14:34:35,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356750381] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:35,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:35,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-14 14:34:35,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422213399] [2024-06-14 14:34:35,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:35,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 14:34:35,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:35,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 14:34:35,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-14 14:34:35,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:34:35,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 277 transitions, 2776 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:35,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:35,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:34:35,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:35,581 INFO L124 PetriNetUnfolderBase]: 746/1306 cut-off events. [2024-06-14 14:34:35,581 INFO L125 PetriNetUnfolderBase]: For 178844/178844 co-relation queries the response was YES. [2024-06-14 14:34:35,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9491 conditions, 1306 events. 746/1306 cut-off events. For 178844/178844 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 6876 event pairs, 88 based on Foata normal form. 2/1307 useless extension candidates. Maximal degree in co-relation 9352. Up to 1214 conditions per place. [2024-06-14 14:34:35,594 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 262 selfloop transitions, 31 changer transitions 0/295 dead transitions. [2024-06-14 14:34:35,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 295 transitions, 3424 flow [2024-06-14 14:34:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:34:35,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:34:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-14 14:34:35,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4125 [2024-06-14 14:34:35,596 INFO L175 Difference]: Start difference. First operand has 306 places, 277 transitions, 2776 flow. Second operand 10 states and 132 transitions. [2024-06-14 14:34:35,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 295 transitions, 3424 flow [2024-06-14 14:34:36,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 295 transitions, 3325 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-14 14:34:36,232 INFO L231 Difference]: Finished difference. Result has 307 places, 278 transitions, 2759 flow [2024-06-14 14:34:36,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2677, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2759, PETRI_PLACES=307, PETRI_TRANSITIONS=278} [2024-06-14 14:34:36,236 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 276 predicate places. [2024-06-14 14:34:36,236 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 278 transitions, 2759 flow [2024-06-14 14:34:36,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:36,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:36,236 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 14:34:36,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-14 14:34:36,237 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 14:34:36,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:36,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1071026568, now seen corresponding path program 13 times [2024-06-14 14:34:36,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:36,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674336553] [2024-06-14 14:34:36,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:36,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:34:43,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:43,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674336553] [2024-06-14 14:34:43,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674336553] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:43,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:43,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:34:43,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089362561] [2024-06-14 14:34:43,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:43,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:34:43,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:43,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:34:43,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:34:43,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-14 14:34:43,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 278 transitions, 2759 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:43,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:43,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-14 14:34:43,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:44,322 INFO L124 PetriNetUnfolderBase]: 742/1300 cut-off events. [2024-06-14 14:34:44,322 INFO L125 PetriNetUnfolderBase]: For 171787/171787 co-relation queries the response was YES. [2024-06-14 14:34:44,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9249 conditions, 1300 events. 742/1300 cut-off events. For 171787/171787 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 6851 event pairs, 79 based on Foata normal form. 2/1301 useless extension candidates. Maximal degree in co-relation 9109. Up to 1160 conditions per place. [2024-06-14 14:34:44,334 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 250 selfloop transitions, 45 changer transitions 0/297 dead transitions. [2024-06-14 14:34:44,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 297 transitions, 3405 flow [2024-06-14 14:34:44,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:34:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:34:44,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2024-06-14 14:34:44,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41761363636363635 [2024-06-14 14:34:44,335 INFO L175 Difference]: Start difference. First operand has 307 places, 278 transitions, 2759 flow. Second operand 11 states and 147 transitions. [2024-06-14 14:34:44,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 297 transitions, 3405 flow [2024-06-14 14:34:44,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 297 transitions, 3323 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-14 14:34:44,884 INFO L231 Difference]: Finished difference. Result has 310 places, 278 transitions, 2772 flow [2024-06-14 14:34:44,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2677, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2772, PETRI_PLACES=310, PETRI_TRANSITIONS=278} [2024-06-14 14:34:44,885 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 279 predicate places. [2024-06-14 14:34:44,885 INFO L495 AbstractCegarLoop]: Abstraction has has 310 places, 278 transitions, 2772 flow [2024-06-14 14:34:44,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:44,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:44,885 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 14:34:44,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-14 14:34:44,885 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:34:44,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:44,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1065462378, now seen corresponding path program 14 times [2024-06-14 14:34:44,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:44,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086266095] [2024-06-14 14:34:44,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:44,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:34:52,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 14:34:52,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:34:52,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086266095] [2024-06-14 14:34:52,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086266095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:34:52,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:34:52,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:34:52,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805672445] [2024-06-14 14:34:52,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:34:52,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:34:52,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:34:52,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:34:52,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:34:53,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:34:53,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 278 transitions, 2772 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:53,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:34:53,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:34:53,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:34:53,857 INFO L124 PetriNetUnfolderBase]: 738/1294 cut-off events. [2024-06-14 14:34:53,857 INFO L125 PetriNetUnfolderBase]: For 164175/164175 co-relation queries the response was YES. [2024-06-14 14:34:53,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9051 conditions, 1294 events. 738/1294 cut-off events. For 164175/164175 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 6838 event pairs, 76 based on Foata normal form. 2/1295 useless extension candidates. Maximal degree in co-relation 8910. Up to 1154 conditions per place. [2024-06-14 14:34:53,867 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 249 selfloop transitions, 46 changer transitions 0/297 dead transitions. [2024-06-14 14:34:53,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 297 transitions, 3418 flow [2024-06-14 14:34:53,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:34:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:34:53,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 14:34:53,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-14 14:34:53,869 INFO L175 Difference]: Start difference. First operand has 310 places, 278 transitions, 2772 flow. Second operand 11 states and 135 transitions. [2024-06-14 14:34:53,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 297 transitions, 3418 flow [2024-06-14 14:34:54,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 297 transitions, 3313 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-14 14:34:54,398 INFO L231 Difference]: Finished difference. Result has 312 places, 278 transitions, 2764 flow [2024-06-14 14:34:54,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2667, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2764, PETRI_PLACES=312, PETRI_TRANSITIONS=278} [2024-06-14 14:34:54,399 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 281 predicate places. [2024-06-14 14:34:54,399 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 278 transitions, 2764 flow [2024-06-14 14:34:54,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:34:54,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:34:54,399 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 14:34:54,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-14 14:34:54,399 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:34:54,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:34:54,400 INFO L85 PathProgramCache]: Analyzing trace with hash -2120039387, now seen corresponding path program 12 times [2024-06-14 14:34:54,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:34:54,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114812488] [2024-06-14 14:34:54,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:34:54,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:34:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:00,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:00,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114812488] [2024-06-14 14:35:00,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114812488] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:00,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:00,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:35:00,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210202276] [2024-06-14 14:35:00,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:00,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:35:00,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:00,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:35:00,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:35:00,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:35:00,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 278 transitions, 2764 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:00,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:00,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:35:00,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:01,120 INFO L124 PetriNetUnfolderBase]: 742/1302 cut-off events. [2024-06-14 14:35:01,121 INFO L125 PetriNetUnfolderBase]: For 167563/167563 co-relation queries the response was YES. [2024-06-14 14:35:01,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9112 conditions, 1302 events. 742/1302 cut-off events. For 167563/167563 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 6872 event pairs, 82 based on Foata normal form. 2/1303 useless extension candidates. Maximal degree in co-relation 8970. Up to 1192 conditions per place. [2024-06-14 14:35:01,136 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 251 selfloop transitions, 43 changer transitions 0/296 dead transitions. [2024-06-14 14:35:01,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 296 transitions, 3416 flow [2024-06-14 14:35:01,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:35:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:35:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2024-06-14 14:35:01,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3778409090909091 [2024-06-14 14:35:01,137 INFO L175 Difference]: Start difference. First operand has 312 places, 278 transitions, 2764 flow. Second operand 11 states and 133 transitions. [2024-06-14 14:35:01,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 296 transitions, 3416 flow [2024-06-14 14:35:01,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 296 transitions, 3297 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-14 14:35:01,728 INFO L231 Difference]: Finished difference. Result has 312 places, 279 transitions, 2755 flow [2024-06-14 14:35:01,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2645, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2755, PETRI_PLACES=312, PETRI_TRANSITIONS=279} [2024-06-14 14:35:01,728 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 281 predicate places. [2024-06-14 14:35:01,728 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 279 transitions, 2755 flow [2024-06-14 14:35:01,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:01,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:01,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 14:35:01,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-14 14:35:01,729 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:35:01,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:01,729 INFO L85 PathProgramCache]: Analyzing trace with hash -453413441, now seen corresponding path program 13 times [2024-06-14 14:35:01,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:01,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449915763] [2024-06-14 14:35:01,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:01,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:07,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:07,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:07,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449915763] [2024-06-14 14:35:07,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449915763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:07,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:07,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:35:07,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097004956] [2024-06-14 14:35:07,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:07,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:35:07,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:07,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:35:07,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:35:08,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:35:08,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 279 transitions, 2755 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:08,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:08,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:35:08,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:08,712 INFO L124 PetriNetUnfolderBase]: 746/1310 cut-off events. [2024-06-14 14:35:08,712 INFO L125 PetriNetUnfolderBase]: For 170587/170587 co-relation queries the response was YES. [2024-06-14 14:35:08,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9165 conditions, 1310 events. 746/1310 cut-off events. For 170587/170587 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 6930 event pairs, 86 based on Foata normal form. 2/1311 useless extension candidates. Maximal degree in co-relation 9022. Up to 1182 conditions per place. [2024-06-14 14:35:08,726 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 244 selfloop transitions, 52 changer transitions 0/298 dead transitions. [2024-06-14 14:35:08,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 298 transitions, 3415 flow [2024-06-14 14:35:08,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-14 14:35:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-14 14:35:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2024-06-14 14:35:08,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3723958333333333 [2024-06-14 14:35:08,728 INFO L175 Difference]: Start difference. First operand has 312 places, 279 transitions, 2755 flow. Second operand 12 states and 143 transitions. [2024-06-14 14:35:08,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 298 transitions, 3415 flow [2024-06-14 14:35:09,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 298 transitions, 3315 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 14:35:09,317 INFO L231 Difference]: Finished difference. Result has 315 places, 280 transitions, 2787 flow [2024-06-14 14:35:09,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2655, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2787, PETRI_PLACES=315, PETRI_TRANSITIONS=280} [2024-06-14 14:35:09,318 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 284 predicate places. [2024-06-14 14:35:09,318 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 280 transitions, 2787 flow [2024-06-14 14:35:09,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:09,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:09,318 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 14:35:09,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-14 14:35:09,318 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:35:09,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:09,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1610840237, now seen corresponding path program 14 times [2024-06-14 14:35:09,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:09,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950137472] [2024-06-14 14:35:09,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:09,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:16,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:16,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950137472] [2024-06-14 14:35:16,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950137472] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:16,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:16,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:35:16,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398881274] [2024-06-14 14:35:16,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:16,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:35:16,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:16,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:35:16,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:35:16,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:35:16,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 280 transitions, 2787 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:16,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:16,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:35:16,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:17,044 INFO L124 PetriNetUnfolderBase]: 750/1318 cut-off events. [2024-06-14 14:35:17,045 INFO L125 PetriNetUnfolderBase]: For 174016/174016 co-relation queries the response was YES. [2024-06-14 14:35:17,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9254 conditions, 1318 events. 750/1318 cut-off events. For 174016/174016 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 7010 event pairs, 82 based on Foata normal form. 2/1319 useless extension candidates. Maximal degree in co-relation 9110. Up to 1164 conditions per place. [2024-06-14 14:35:17,060 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 243 selfloop transitions, 54 changer transitions 0/299 dead transitions. [2024-06-14 14:35:17,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 299 transitions, 3451 flow [2024-06-14 14:35:17,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:35:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:35:17,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-14 14:35:17,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-06-14 14:35:17,062 INFO L175 Difference]: Start difference. First operand has 315 places, 280 transitions, 2787 flow. Second operand 11 states and 135 transitions. [2024-06-14 14:35:17,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 299 transitions, 3451 flow [2024-06-14 14:35:17,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 299 transitions, 3326 flow, removed 11 selfloop flow, removed 10 redundant places. [2024-06-14 14:35:17,658 INFO L231 Difference]: Finished difference. Result has 316 places, 281 transitions, 2798 flow [2024-06-14 14:35:17,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2664, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2798, PETRI_PLACES=316, PETRI_TRANSITIONS=281} [2024-06-14 14:35:17,659 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 285 predicate places. [2024-06-14 14:35:17,659 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 281 transitions, 2798 flow [2024-06-14 14:35:17,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:17,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:17,659 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 14:35:17,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-14 14:35:17,660 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:35:17,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:17,660 INFO L85 PathProgramCache]: Analyzing trace with hash 227128817, now seen corresponding path program 15 times [2024-06-14 14:35:17,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:17,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444882178] [2024-06-14 14:35:17,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:17,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:24,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:24,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444882178] [2024-06-14 14:35:24,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444882178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:24,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:24,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:35:24,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788461588] [2024-06-14 14:35:24,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:24,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:35:24,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:24,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:35:24,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:35:24,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:35:24,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 281 transitions, 2798 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:24,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:24,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:35:24,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:25,186 INFO L124 PetriNetUnfolderBase]: 770/1362 cut-off events. [2024-06-14 14:35:25,187 INFO L125 PetriNetUnfolderBase]: For 230992/230992 co-relation queries the response was YES. [2024-06-14 14:35:25,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9413 conditions, 1362 events. 770/1362 cut-off events. For 230992/230992 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 7277 event pairs, 94 based on Foata normal form. 12/1373 useless extension candidates. Maximal degree in co-relation 9268. Up to 1210 conditions per place. [2024-06-14 14:35:25,201 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 260 selfloop transitions, 30 changer transitions 9/301 dead transitions. [2024-06-14 14:35:25,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 301 transitions, 3490 flow [2024-06-14 14:35:25,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:35:25,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:35:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-14 14:35:25,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3664772727272727 [2024-06-14 14:35:25,203 INFO L175 Difference]: Start difference. First operand has 316 places, 281 transitions, 2798 flow. Second operand 11 states and 129 transitions. [2024-06-14 14:35:25,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 301 transitions, 3490 flow [2024-06-14 14:35:25,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 301 transitions, 3366 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-14 14:35:25,788 INFO L231 Difference]: Finished difference. Result has 318 places, 278 transitions, 2720 flow [2024-06-14 14:35:25,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2674, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2720, PETRI_PLACES=318, PETRI_TRANSITIONS=278} [2024-06-14 14:35:25,789 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 287 predicate places. [2024-06-14 14:35:25,789 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 278 transitions, 2720 flow [2024-06-14 14:35:25,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:25,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:25,798 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 14:35:25,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-14 14:35:25,799 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:35:25,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:25,799 INFO L85 PathProgramCache]: Analyzing trace with hash 168946286, now seen corresponding path program 6 times [2024-06-14 14:35:25,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:25,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140768401] [2024-06-14 14:35:25,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:25,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:32,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:32,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:32,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140768401] [2024-06-14 14:35:32,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140768401] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:32,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:32,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:35:32,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128180901] [2024-06-14 14:35:32,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:32,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:35:32,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:32,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:35:32,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:35:32,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:35:32,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 278 transitions, 2720 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:32,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:32,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:35:32,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:33,269 INFO L124 PetriNetUnfolderBase]: 758/1346 cut-off events. [2024-06-14 14:35:33,269 INFO L125 PetriNetUnfolderBase]: For 177112/177112 co-relation queries the response was YES. [2024-06-14 14:35:33,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9297 conditions, 1346 events. 758/1346 cut-off events. For 177112/177112 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 7233 event pairs, 102 based on Foata normal form. 2/1347 useless extension candidates. Maximal degree in co-relation 9151. Up to 1300 conditions per place. [2024-06-14 14:35:33,284 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 271 selfloop transitions, 18 changer transitions 0/291 dead transitions. [2024-06-14 14:35:33,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 291 transitions, 3342 flow [2024-06-14 14:35:33,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:35:33,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:35:33,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-14 14:35:33,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-14 14:35:33,285 INFO L175 Difference]: Start difference. First operand has 318 places, 278 transitions, 2720 flow. Second operand 10 states and 108 transitions. [2024-06-14 14:35:33,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 291 transitions, 3342 flow [2024-06-14 14:35:33,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 291 transitions, 3157 flow, removed 12 selfloop flow, removed 11 redundant places. [2024-06-14 14:35:33,888 INFO L231 Difference]: Finished difference. Result has 317 places, 279 transitions, 2593 flow [2024-06-14 14:35:33,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2535, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2593, PETRI_PLACES=317, PETRI_TRANSITIONS=279} [2024-06-14 14:35:33,889 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 286 predicate places. [2024-06-14 14:35:33,889 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 279 transitions, 2593 flow [2024-06-14 14:35:33,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:33,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:33,889 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 14:35:33,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-14 14:35:33,890 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:35:33,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:33,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1622178058, now seen corresponding path program 7 times [2024-06-14 14:35:33,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:33,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604663816] [2024-06-14 14:35:33,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:33,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:42,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:42,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:42,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604663816] [2024-06-14 14:35:42,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604663816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:42,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:42,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:35:42,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572312215] [2024-06-14 14:35:42,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:42,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:35:42,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:42,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:35:42,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:35:42,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:35:42,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 279 transitions, 2593 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:42,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:42,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:35:42,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:42,814 INFO L124 PetriNetUnfolderBase]: 762/1354 cut-off events. [2024-06-14 14:35:42,815 INFO L125 PetriNetUnfolderBase]: For 180204/180204 co-relation queries the response was YES. [2024-06-14 14:35:42,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9225 conditions, 1354 events. 762/1354 cut-off events. For 180204/180204 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 7296 event pairs, 96 based on Foata normal form. 2/1355 useless extension candidates. Maximal degree in co-relation 9079. Up to 1286 conditions per place. [2024-06-14 14:35:42,829 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 267 selfloop transitions, 25 changer transitions 0/294 dead transitions. [2024-06-14 14:35:42,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 294 transitions, 3233 flow [2024-06-14 14:35:42,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:35:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:35:42,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-14 14:35:42,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3625 [2024-06-14 14:35:42,830 INFO L175 Difference]: Start difference. First operand has 317 places, 279 transitions, 2593 flow. Second operand 10 states and 116 transitions. [2024-06-14 14:35:42,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 294 transitions, 3233 flow [2024-06-14 14:35:43,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 294 transitions, 3185 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-14 14:35:43,377 INFO L231 Difference]: Finished difference. Result has 319 places, 280 transitions, 2619 flow [2024-06-14 14:35:43,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2545, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2619, PETRI_PLACES=319, PETRI_TRANSITIONS=280} [2024-06-14 14:35:43,377 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 288 predicate places. [2024-06-14 14:35:43,377 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 280 transitions, 2619 flow [2024-06-14 14:35:43,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:43,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:43,378 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 14:35:43,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-14 14:35:43,378 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:35:43,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:43,379 INFO L85 PathProgramCache]: Analyzing trace with hash -2020577190, now seen corresponding path program 8 times [2024-06-14 14:35:43,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:43,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747942073] [2024-06-14 14:35:43,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:43,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:50,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:50,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747942073] [2024-06-14 14:35:50,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747942073] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:50,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:50,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:35:50,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146330150] [2024-06-14 14:35:50,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:50,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:35:50,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:50,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:35:50,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:35:50,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:35:50,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 280 transitions, 2619 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:50,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:50,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:35:50,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:50,720 INFO L124 PetriNetUnfolderBase]: 766/1362 cut-off events. [2024-06-14 14:35:50,720 INFO L125 PetriNetUnfolderBase]: For 183595/183595 co-relation queries the response was YES. [2024-06-14 14:35:50,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9314 conditions, 1362 events. 766/1362 cut-off events. For 183595/183595 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 7363 event pairs, 104 based on Foata normal form. 2/1363 useless extension candidates. Maximal degree in co-relation 9167. Up to 1316 conditions per place. [2024-06-14 14:35:50,735 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 272 selfloop transitions, 19 changer transitions 0/293 dead transitions. [2024-06-14 14:35:50,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 293 transitions, 3251 flow [2024-06-14 14:35:50,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:35:50,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:35:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-14 14:35:50,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.340625 [2024-06-14 14:35:50,737 INFO L175 Difference]: Start difference. First operand has 319 places, 280 transitions, 2619 flow. Second operand 10 states and 109 transitions. [2024-06-14 14:35:50,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 293 transitions, 3251 flow [2024-06-14 14:35:51,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 293 transitions, 3187 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-14 14:35:51,451 INFO L231 Difference]: Finished difference. Result has 321 places, 281 transitions, 2619 flow [2024-06-14 14:35:51,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2555, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2619, PETRI_PLACES=321, PETRI_TRANSITIONS=281} [2024-06-14 14:35:51,452 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 290 predicate places. [2024-06-14 14:35:51,452 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 281 transitions, 2619 flow [2024-06-14 14:35:51,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:51,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:51,452 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 14:35:51,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-14 14:35:51,453 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:35:51,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:51,453 INFO L85 PathProgramCache]: Analyzing trace with hash 324628842, now seen corresponding path program 15 times [2024-06-14 14:35:51,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:51,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375638112] [2024-06-14 14:35:51,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:51,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:35:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:35:58,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:35:58,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:35:58,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375638112] [2024-06-14 14:35:58,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375638112] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:35:58,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:35:58,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:35:58,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57263638] [2024-06-14 14:35:58,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:35:58,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:35:58,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:35:58,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:35:58,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:35:58,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:35:58,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 281 transitions, 2619 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:58,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:35:58,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:35:58,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:35:59,304 INFO L124 PetriNetUnfolderBase]: 772/1372 cut-off events. [2024-06-14 14:35:59,305 INFO L125 PetriNetUnfolderBase]: For 186850/186850 co-relation queries the response was YES. [2024-06-14 14:35:59,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9353 conditions, 1372 events. 772/1372 cut-off events. For 186850/186850 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 7457 event pairs, 92 based on Foata normal form. 2/1373 useless extension candidates. Maximal degree in co-relation 9205. Up to 1286 conditions per place. [2024-06-14 14:35:59,320 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 268 selfloop transitions, 29 changer transitions 0/299 dead transitions. [2024-06-14 14:35:59,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 299 transitions, 3285 flow [2024-06-14 14:35:59,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:35:59,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:35:59,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-14 14:35:59,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36079545454545453 [2024-06-14 14:35:59,321 INFO L175 Difference]: Start difference. First operand has 321 places, 281 transitions, 2619 flow. Second operand 11 states and 127 transitions. [2024-06-14 14:35:59,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 299 transitions, 3285 flow [2024-06-14 14:35:59,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 299 transitions, 3194 flow, removed 11 selfloop flow, removed 10 redundant places. [2024-06-14 14:35:59,958 INFO L231 Difference]: Finished difference. Result has 322 places, 283 transitions, 2621 flow [2024-06-14 14:35:59,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2528, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2621, PETRI_PLACES=322, PETRI_TRANSITIONS=283} [2024-06-14 14:35:59,958 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 291 predicate places. [2024-06-14 14:35:59,958 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 283 transitions, 2621 flow [2024-06-14 14:35:59,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:35:59,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:35:59,959 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 14:35:59,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-14 14:35:59,959 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:35:59,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:35:59,959 INFO L85 PathProgramCache]: Analyzing trace with hash -89610454, now seen corresponding path program 9 times [2024-06-14 14:35:59,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:35:59,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994710605] [2024-06-14 14:35:59,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:35:59,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:06,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:06,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:06,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994710605] [2024-06-14 14:36:06,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994710605] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:06,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:06,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:36:06,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841206848] [2024-06-14 14:36:06,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:06,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:36:06,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:06,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:36:06,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:36:06,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:36:06,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 283 transitions, 2621 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:06,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:06,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:36:06,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:06,699 INFO L124 PetriNetUnfolderBase]: 776/1380 cut-off events. [2024-06-14 14:36:06,699 INFO L125 PetriNetUnfolderBase]: For 190217/190217 co-relation queries the response was YES. [2024-06-14 14:36:06,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9378 conditions, 1380 events. 776/1380 cut-off events. For 190217/190217 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 7508 event pairs, 102 based on Foata normal form. 2/1381 useless extension candidates. Maximal degree in co-relation 9231. Up to 1342 conditions per place. [2024-06-14 14:36:06,715 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 279 selfloop transitions, 16 changer transitions 0/297 dead transitions. [2024-06-14 14:36:06,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 297 transitions, 3275 flow [2024-06-14 14:36:06,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:36:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:36:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-14 14:36:06,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-14 14:36:06,717 INFO L175 Difference]: Start difference. First operand has 322 places, 283 transitions, 2621 flow. Second operand 10 states and 108 transitions. [2024-06-14 14:36:06,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 297 transitions, 3275 flow [2024-06-14 14:36:07,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 297 transitions, 3201 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-14 14:36:07,388 INFO L231 Difference]: Finished difference. Result has 324 places, 285 transitions, 2624 flow [2024-06-14 14:36:07,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2547, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2624, PETRI_PLACES=324, PETRI_TRANSITIONS=285} [2024-06-14 14:36:07,388 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 293 predicate places. [2024-06-14 14:36:07,388 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 285 transitions, 2624 flow [2024-06-14 14:36:07,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:07,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:07,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:07,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-14 14:36:07,389 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:36:07,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:07,390 INFO L85 PathProgramCache]: Analyzing trace with hash -765572, now seen corresponding path program 16 times [2024-06-14 14:36:07,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:07,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107967394] [2024-06-14 14:36:07,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:07,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 14:36:15,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:15,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107967394] [2024-06-14 14:36:15,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107967394] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:15,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:15,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-14 14:36:15,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407975914] [2024-06-14 14:36:15,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:15,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-14 14:36:15,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:15,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-14 14:36:15,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-14 14:36:15,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:36:15,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 285 transitions, 2624 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:15,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:15,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:36:15,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:16,383 INFO L124 PetriNetUnfolderBase]: 772/1374 cut-off events. [2024-06-14 14:36:16,383 INFO L125 PetriNetUnfolderBase]: For 180776/180776 co-relation queries the response was YES. [2024-06-14 14:36:16,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9110 conditions, 1374 events. 772/1374 cut-off events. For 180776/180776 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 7481 event pairs, 91 based on Foata normal form. 2/1375 useless extension candidates. Maximal degree in co-relation 8961. Up to 1288 conditions per place. [2024-06-14 14:36:16,398 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 270 selfloop transitions, 29 changer transitions 0/301 dead transitions. [2024-06-14 14:36:16,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 301 transitions, 3268 flow [2024-06-14 14:36:16,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-14 14:36:16,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-14 14:36:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-14 14:36:16,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-14 14:36:16,403 INFO L175 Difference]: Start difference. First operand has 324 places, 285 transitions, 2624 flow. Second operand 11 states and 128 transitions. [2024-06-14 14:36:16,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 301 transitions, 3268 flow [2024-06-14 14:36:17,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 301 transitions, 3192 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-14 14:36:17,018 INFO L231 Difference]: Finished difference. Result has 327 places, 285 transitions, 2611 flow [2024-06-14 14:36:17,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2548, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2611, PETRI_PLACES=327, PETRI_TRANSITIONS=285} [2024-06-14 14:36:17,018 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 296 predicate places. [2024-06-14 14:36:17,019 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 285 transitions, 2611 flow [2024-06-14 14:36:17,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:17,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:17,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 14:36:17,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-14 14:36:17,019 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:36:17,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:17,020 INFO L85 PathProgramCache]: Analyzing trace with hash 2008692826, now seen corresponding path program 10 times [2024-06-14 14:36:17,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:17,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462568450] [2024-06-14 14:36:17,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:17,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 14:36:26,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 14:36:26,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 14:36:26,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462568450] [2024-06-14 14:36:26,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462568450] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 14:36:26,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 14:36:26,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-14 14:36:26,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373371299] [2024-06-14 14:36:26,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 14:36:26,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-14 14:36:26,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 14:36:26,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-14 14:36:26,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-14 14:36:26,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-14 14:36:26,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 285 transitions, 2611 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:26,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 14:36:26,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-14 14:36:26,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 14:36:26,757 INFO L124 PetriNetUnfolderBase]: 776/1382 cut-off events. [2024-06-14 14:36:26,758 INFO L125 PetriNetUnfolderBase]: For 183836/183836 co-relation queries the response was YES. [2024-06-14 14:36:26,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9180 conditions, 1382 events. 776/1382 cut-off events. For 183836/183836 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 7541 event pairs, 101 based on Foata normal form. 2/1383 useless extension candidates. Maximal degree in co-relation 9030. Up to 1335 conditions per place. [2024-06-14 14:36:26,769 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 278 selfloop transitions, 19 changer transitions 0/299 dead transitions. [2024-06-14 14:36:26,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 299 transitions, 3263 flow [2024-06-14 14:36:26,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-14 14:36:26,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-14 14:36:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-14 14:36:26,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.346875 [2024-06-14 14:36:26,771 INFO L175 Difference]: Start difference. First operand has 327 places, 285 transitions, 2611 flow. Second operand 10 states and 111 transitions. [2024-06-14 14:36:26,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 299 transitions, 3263 flow [2024-06-14 14:36:27,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 299 transitions, 3185 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-14 14:36:27,351 INFO L231 Difference]: Finished difference. Result has 327 places, 286 transitions, 2601 flow [2024-06-14 14:36:27,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2533, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2601, PETRI_PLACES=327, PETRI_TRANSITIONS=286} [2024-06-14 14:36:27,351 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 296 predicate places. [2024-06-14 14:36:27,351 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 286 transitions, 2601 flow [2024-06-14 14:36:27,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 14:36:27,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 14:36:27,352 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 14:36:27,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-14 14:36:27,352 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 14:36:27,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 14:36:27,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1682881276, now seen corresponding path program 17 times [2024-06-14 14:36:27,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 14:36:27,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131917592] [2024-06-14 14:36:27,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 14:36:27,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 14:36:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15